Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.05317

A Simple Algorithm Breaking the 1/3 Barrier for Approximate Nash Equilibria in Bimatrix Games

Dongchen Li·Hanyu Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 approximate Nash equilibria. Despite sustained efforts, breaking the $1/3$ barrier has long been regarded as a difficult open problem. In this paper, we give an affirmative answer by proposing a simple, symmetric deterministic polynomial-time algorithm that has no tunable hyperparameters and achieves an approximation guarantee of approximately $0.30954+δ$. The main idea is to enrich the optimization framework of Tsaknakis and Spirakis with building blocks drawn from our work on strategy mixing and automated approximation analysis, yielding a new algorithmic structure that provides a conceptual explanation for the improved guarantee.

Explore related subjects

cs.GTcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dongchen Li, Hanyu Li. 2026-10-04. A Simple Algorithm Breaking the 1/3 Barrier for Approximate Nash Equilibria in Bimatrix Games. https://arxiv.org/abs/2610.05317

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Fair Allocation with Best-of-Many-Worlds Guarantees

We investigate the online fair allocation problem with sequentially arriving items under various input models, with the goal of balancing fairness and efficiency. We propose the unconstrained PACE (Pacing According to Current Estimated utility) algorithm, a parameter-free allocation dynamic that requires no prior knowledge of the input while using only integral allocations. PACE attains near-optimal convergence or approximation guarantees under stationary, stochastic-but-nonstationary, and adversarial input types, thereby achieving the first best-of-many-worlds guarantee in online fair allocation. Beyond theoretical bounds, PACE is highly simple, efficient, and decentralized, and is thus likely to perform well on a broad range of real-world inputs. Numerical results support the conclusion that PACE works well under a variety of input models. We find that PACE performs very well on two real-world datasets even under the true temporal arrivals in the data, which are highly nonstationary.

cs.GT↗
arXiv2026

Playing with Peaks: A Game-Theoretic Comparison of Electricity Pricing Mechanisms

As electricity consumption grows, reducing peak demand--the maximum load on the grid--has become critical for preventing infrastructure strain and blackouts. Pricing mechanisms that incentivize consumers with flexible loads to shift consumption away from high-demand periods have emerged as effective tools, yet different mechanisms are used in practice with unclear relative performance. This work compares two widely implemented approaches: anytime peak pricing (AP), where consumers pay for their individual maximum consumption, and coincident peak pricing (CP), where consumers pay for their consumption during the system-wide peak period. To compare these mechanisms, we model the electricity market as a strategic game and characterize the peak demand in equilibrium under both AP and CP. Our main result demonstrates that with perfect information, equilibrium peak demand under CP never exceeds that under AP; on the other hand, with imperfect information, the coordination introduced by CP can backfire and induce larger equilibrium peaks than AP. These findings demonstrate that potential gains from coupling users' costs (as done in CP) must be weighed against these miscoordination risks. We conclude with preliminary results indicating that progressive demand cost structures--rather than per-unit charges--may mitigate these risks while preserving coordination benefits, achieving desirable performance in both deterministic and stochastic settings.

cs.GT↗
arXiv2026

Stationary Online Contention Resolution Schemes: Theory and Applications to Bayesian Online Resource Allocation

Motivated by problems in Bayesian reusable resource allocation, we introduce the concept of stationary online contention resolution schemes (S-OCRSs). OCRSs are a central tool used to solve non-reusable resource allocation problems. They convert solutions to fluid approximations of problems into feasible online policies while approximately preserving allocation probabilities. S-OCRSs depart from standard OCRSs in that they ensure that the probability of allocating any given set of resources is independent of the arrival order of requests. We show how S-OCRSs can be used to solve reusable resource allocation problems, and discuss a general 'maximum-entropy' approach to construct and analyze S-OCRSs. Our approach, using a unified method for a variety of feasibility constraints, obtains results that match the state-of-the-art for OCRSs, and even improves it for a bipartite matching feasibility constraint. Our results for reusable resource allocation also extend to the assortment optimization setting, and our policies can be implemented using prices.

cs.GT↗