arXiv (All)
open access
Breaking the 1/3 Barrier for Approximate Nash Equilibria in Symmetric Bimatrix Games
We give the first unconditional family of polynomial-time algorithms that breaks the $1/3$ approximation barrier for symmetric bimatrix games. For every fixed $δ>0$, an algorithm in this family computes a symmetric $(1-1/\sqrt{2}+δ)$-approximate Nash equilibrium, improving on the previous best guara
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 Simple Algorithm Breaking the 1/3 Barrier for Approximate Nash Equilibria in Bimatrix Games#1201330
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Eigenvalue and Eigenvector Approximation for Random Matrices Using Low-Degree Polynomials#1076437
- The Complexity of Exact and Approximate Nash Equilibria in Anonymous Games#1341731
- A simplified proof of polynomial improvements for 3SUM and APSP#1326913
Record · ID 1400348
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