Complexity Results about Nash Equilibria

05/28/2002
by   Vincent Conitzer, et al.
0

Noncooperative game theory provides a normative framework for analyzing strategic interactions. However, for the toolbox to be operational, the solutions it defines will have to be computed. In this paper, we provide a single reduction that 1) demonstrates NP-hardness of determining whether Nash equilibria with certain natural properties exist, and 2) demonstrates the #P-hardness of counting Nash equilibria (or connected sets of Nash equilibria). We also show that 3) determining whether a pure-strategy Bayes-Nash equilibrium exists is NP-hard, and that 4) determining whether a pure-strategy Nash equilibrium exists in a stochastic (Markov) game is PSPACE-hard even if the game is invisible (this remains NP-hard if the game is finite). All of our hardness results hold even if there are only two players and the game is symmetric. Keywords: Nash equilibrium; game theory; computational complexity; noncooperative game theory; normal form game; stochastic game; Markov game; Bayes-Nash equilibrium; multiagent systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2019

The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games

We revisit the complexity of deciding, given a bimatrix game, whether i...
research
05/06/2022

NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Games

We study the complexity of computing a uniform Nash equilibrium on a bim...
research
09/23/2019

Scheduling Games with Machine-Dependent Priority Lists

We consider a scheduling game in which jobs try to minimize their comple...
research
05/06/2021

How to split the costs among travellers sharing a ride? Aligning system's optimum with users' equilibrium

How to form groups in a mobility system that offers shared rides, and ho...
research
10/29/2019

A Game-theoretical Approach to Analyze Film Release Time

Film release dates play an important part in box office revenues because...
research
03/28/2022

Adaptive Learning with Artificial Barriers Yielding Nash Equilibria in General Games

Artificial barriers in Learning Automata (LA) is a powerful and yet unde...
research
05/20/2022

A stochastic game framework for patrolling a border

In this paper we consider a stochastic game for modelling the interactio...

Please sign up or login with your details

Forgot password? Click here to reset