arXiv (All)
open access
Path Polymatrix Games are PPAD-hard
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with at most twenty actions per player, and path polymatrix game with at most four hundred actions per player. These are the first PPAD hardness results for a game with a constant number of actions per player where
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Equilibrium Numbers in Non-Square Bimatrix Games#1051276
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games#1050734
- The Nakamura numbers for computable simple games#1276630
- The Nakamura numbers for computable simple games#1275609
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games#1266079
Record · ID 1187177
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive