Skip to main navigation Skip to search Skip to main content

Theory and Practice of Natural Strategy Checking in Concurrent Games with Imperfect Information

  • University of Naples Federico II

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we explore strategy-checking algorithms in concurrent games with imperfect information, analyzing their computational complexity in comparison to the perfect information setting. Precisely, we analyze uniform natural strategies used by agents with limited memory and computational capacity. We examine the decision problems of Sure Winning and IsNash, as well as other similar decision problems in formal strategic reasoning. Additionally, we develop a tool that demonstrates the practical applicability of the proposed framework.

Original languageEnglish
Title of host publicationAdvances in Practical Applications of Agents, Multi-Agent Systems, and Computational Social Science
Subtitle of host publicationThe PAAMS Collection - 23rd International Conference, PAAMS 2025, Proceedings
EditorsPhilippe Mathieu, Fernando De la Prieta
PublisherSpringer Science and Business Media Deutschland GmbH
Pages15-27
Number of pages13
ISBN (Print)9783032076373
DOIs
Publication statusPublished - 1 Jan 2026
Event23rd International Conference on Practical applications of Agents and Multi-Agent Systems, PAAMS 2025 - Lille, France
Duration: 25 Jun 202527 Jun 2025

Publication series

NameLecture Notes in Computer Science
Volume16031 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Conference on Practical applications of Agents and Multi-Agent Systems, PAAMS 2025
Country/TerritoryFrance
CityLille
Period25/06/2527/06/25

Keywords

  • Concurrent Games
  • Multi-Agent Systems
  • Natural Strategies

Fingerprint

Dive into the research topics of 'Theory and Practice of Natural Strategy Checking in Concurrent Games with Imperfect Information'. Together they form a unique fingerprint.

Cite this