Smoothed Complexity of 2-player Nash Equilibria

07/21/2020
by   Shant Boodaghians, et al.
0

We prove that computing a Nash equilibrium of a two-player (n × n) game with payoffs in [-1,1] is PPAD-hard (under randomized reductions) even in the smoothed analysis setting, smoothing with noise of constant magnitude. This gives a strong negative answer to conjectures of Spielman and Teng [ST06] and Cheng, Deng, and Teng [CDT09]. In contrast to prior work proving PPAD-hardness after smoothing by noise of magnitude 1/poly(n) [CDT09], our smoothed complexity result is not proved via hardness of approximation for Nash equilibria. This is by necessity, since Nash equilibria can be approximated to constant error in quasi-polynomial time [LMM03]. Our results therefore separate smoothed complexity and hardness of approximation for Nash equilibria in two-player games. The key ingredient in our reduction is the use of a random zero-sum game as a gadget to produce two-player games which remain hard even after smoothing. Our analysis crucially shows that all Nash equilibria of random zero-sum games are far from pure (with high probability), and that this remains true even after smoothing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2023

Coarse Correlated Equilibrium Implies Nash Equilibrium in Two-Player Zero-Sum Games

We give a simple proof of the well-known result that the marginal strate...
research
02/27/2020

Tree Polymatrix Games are PPAD-hard

We prove that it is PPAD-hard to compute a Nash equilibrium in a tree po...
research
06/25/2018

Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium

Several works have shown unconditional hardness (via integrality gaps) o...
research
09/02/2021

The Weihrauch degree of finding Nash equilibria in multiplayer games

Is there an algorithm that takes a game in normal form as input, and out...
research
02/22/2022

Forgiving Debt in Financial Network Games

A financial system is represented by a network, where nodes correspond t...
research
02/21/2023

Partial-Information Q-Learning for General Two-Player Stochastic Games

In this article we analyze a partial-information Nash Q-learning algorit...
research
07/14/2022

A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games

Since the seminal PPAD-completeness result for computing a Nash equilibr...

Please sign up or login with your details

Forgot password? Click here to reset