arXiv (All)
open access
The Fine-Grained Complexity of Approximate Nash Equilibrium and Free Games
We study the fine-grained complexity of computing approximate Nash equilibria and approximating the value of free games in the regime where the approximation error vanishes. Under the PCP for PPAD and ETH for PPAD conjectures, we show that computing $\varepsilon$-approximate Nash equilibria in 2-pla
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
- Distributed Statistical Zero-Knowledge Proofs via Sumcheck#187288
- Nash Approximation Gap in Truncated Infinite-horizon Partially Observable Markov Games#1048624
- A proof system for upper and lower bounds in Probabilistic GKAT#427425
- Sumset Structure in Local Computation#1037415
- The Complexity of Approximating the Value in Revealing POMDPs with Long-Run Average Objectives#984247
Record · ID 987882
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