Complexity of Verifying Game Equilibria

DOI10.1007/978-3-540-75254-7_11MaRDI QIDQ3527270zbMATH OpenOpenAlexFDO

Authors Emmanuel Tadjouddine

Publication date 25 September 2008

Published in Multi-Agent Systems and Applications V (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75254-7_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in artificial intelligence (68T01) Applications of game theory (91A80)

Recommendations

• Nash and correlated equilibria: Some complexity considerations
• New complexity results about Nash equilibria
• The complexity of computing a Nash equilibrium
• Complexity of pure-strategy Nash equilibria in non-cooperative games
• The Computational Complexity of Nash Equilibria in Concisely Represented Games

Cited in

(9)

• Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration
• On computational complexity of membership test in flow games and linear production games
• Verification of multiplayer stochastic games via abstract dependency graphs
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Computational complexity of some intelligent computing systems
• A Note on Game Theory and Verification
• Rationality authority for provable rational behavior
• On the Complexity of Equilibria Problems in Angel-Daemon Games
• Verifying Dominant Strategy Equilibria in Auctions

This page was built for publication: Complexity of Verifying Game Equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527270)