arXiv (All)
open access
Finding a Positive Index Nash Equilibrium is PPADS-Complete
Every nondegenerate bimatrix game has a Nash equilibrium of Shapley index +1, since all equilibria are isolated, have index +1 or -1, and their indices sum to +1. We prove that the following promise search problem is PPADS-complete: given a rational bimatrix game promised to be nondegenerate, find a
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
- A Polynomial-Time Strict-Sub-One-Third Approximation Theorem for Bimatrix Games#1119836
- The Complexity of Nash Equilibrium in Network Congestion and Coordination Games#1117937
- Value-positivity for matrix games#1066576
- Equilibrium Numbers in Non-Square Bimatrix Games#1051276
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games#1050734
Record · ID 1050070
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