The Verification Problem for the Subgame Perfect Equilibrium and the Nash Equilibrium in Finite-Horizon Probabilistic Concurrent Game Systems

2025-03-18

AI Summary

This paper investigates the verification problem for Nash equilibria (NE) and subgame-perfect equilibria (SPE) in finite-horizon probabilistic concurrent games—i.e., deciding whether a given strategy profile satisfies the respective equilibrium conditions. We develop a formal semantic framework and verification algorithms by integrating game theory, computational complexity theory, and model checking techniques. Our main contributions are precise complexity characterizations: SPE verification is PSPACE-complete, while NE verification is EXPTIME-complete. This result refutes the intuitive belief that stricter equilibrium concepts necessarily yield harder verification problems. To our knowledge, this is the first work to establish tight complexity bounds for both problems in this setting. The results provide a definitive theoretical boundary for equilibrium analysis in multi-agent systems and establish decidability foundations for automated reasoning about strategic behavior under probabilistic concurrency and bounded horizons.

Technology Category

• Game Theory and Economic Paradigms: Equilibrium
• Multiagent Systems: Mechanism Design
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements

Abstract

Finite-horizon probabilistic multiagent concurrent game systems, also known as finite multiplayer stochastic games, are a well-studied model in artificial intelligence due to their ability to represent a wide range of real-world scenarios involving strategic interactions among agents over a finite amount of iterations (given by the finite-horizon). The analysis of these games typically focuses on evaluating and computing which strategy profiles (functions that represent the behavior of each agent) qualify as equilibria. The two most prominent equilibrium concepts are the emph{Nash equilibrium} and the emph{subgame perfect equilibrium}, with the latter considered a conceptual refinement of the former. However, computing these equilibria from scratch is often computationally infeasible. Therefore, recent attention has shifted to the verification problem, where a given strategy profile must be evaluated to determine whether it satisfies equilibrium conditions. In this paper, we demonstrate that the verification problem for subgame perfect equilibria lies in PSPACE, while for Nash equilibria, it is EXPTIME-complete. This is a highly counterintuitive result since the subgame equilibria are often seen as a strict strengthening of the Nash equilibrium and are intuitively seen as more complicated.

Problem

• Verification of subgame perfect equilibrium in PSPACE.
• Verification of Nash equilibrium is EXPTIME-complete.
• Analyzing equilibria in finite-horizon probabilistic concurrent games.

Innovation

• Verification problem for equilibria in game systems
• PSPACE complexity for subgame perfect equilibria
• EXPTIME-complete complexity for Nash equilibria