Settling the complexity of Nash equilibrium in congestion games

12/08/2020
by   Yakov Babichenko, et al.
0

We consider (i) the problem of finding a (possibly mixed) Nash equilibrium in congestion games, and (ii) the problem of finding an (exponential precision) fixed point of the gradient descent dynamics of a smooth function f:[0,1]^n →ℝ. We prove that these problems are equivalent. Our result holds for various explicit descriptions of f, ranging from (almost general) arithmetic circuits, to degree-5 polynomials. By a very recent result of [Fearnley, Goldberg, Hollender, Savani '20] this implies that these problems are PPAD∩PLS-complete. As a corollary, we also obtain the following equivalence of complexity classes: CCLS = PPAD∩PLS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2020

Communication complexity of Nash equilibrium in potential games

We prove communication complexity lower bounds for (possibly mixed) Nash...
research
05/20/2020

Computations and Complexities of Tarski's Fixed Points and Supermodular Games

We consider two models of computation for Tarski's order preserving func...
research
04/08/2018

The Communication Complexity of Local Search

We study the following communication variant of local search. There is s...
research
12/21/2017

Infinitely Split Nash Equilibrium Problems in Repeated Games

In this paper, we introduce the concept of infinitely split Nash equilib...
research
02/15/2022

Provably convergent quasistatic dynamics for mean-field two-player zero-sum games

In this paper, we study the problem of finding mixed Nash equilibrium fo...
research
07/15/2022

The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points

Introduced by the celebrated works of Debreu and Rosen in the 1950s and ...
research
06/20/2022

MF-OMO: An Optimization Formulation of Mean-Field Games

Theory of mean-field games (MFGs) has recently experienced an exponentia...

Please sign up or login with your details

Forgot password? Click here to reset