arXiv (All)
open access
A Simple Algorithm Breaking the 1/3 Barrier for Approximate Nash Equilibria in Bimatrix Games
The PPAD-completeness of computing Nash equilibria in bimatrix games has driven extensive research into polynomial-time algorithms for $ε$-approximate Nash equilibria. Determining the strongest approximation guarantee achievable in polynomial time is a fundamental question in the complexity of appro
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
- Finding a Positive Index Nash Equilibrium is PPADS-Complete#1050070
- The Complexity of Exact and Approximate Nash Equilibria in Anonymous Games#1341731
- Systematic Data Structure Lower Bounds via the Query-with-Sketch Model#1011731
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- A simplified proof of polynomial improvements for 3SUM and APSP#1326913
Record · ID 1201330
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