Breaking the 1/3 Barrier for Approximate Nash Equilibria in Symmetric Bimatrix Games
cs.GT, cs.LG
Submitted: 2026-10-18
Updated: 2026-10-18
Related papers
- Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
- In-Context Credit Assignment via the Core
- Optimal Regret for Online Market Making with Limit Order Book
- Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
- Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
- LLM Bidders Preserve the Mechanism-Level Orderings of Human Bidders