A Robust Characterization of Nash Equilibrium

07/06/2023
by   Florian Brandl, et al.
0

We give a robust characterization of Nash equilibrium by postulating coherent behavior across varying games: Nash equilibrium is the only solution concept that satisfies consequentialism, consistency, and rationality. As a consequence, every equilibrium refinement violates at least one of these properties. We moreover show that every solution concept that approximately satisfies consequentialism, consistency, and rationality returns approximate Nash equilibria. The latter approximation can be made arbitrarily good by increasing the approximation of the axioms. This result extends to various natural subclasses of games such as two-player zero-sum games, potential games, and graphical games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2017

Regular Potential Games

A fundamental problem with the Nash equilibrium concept is the existence...
research
07/20/2020

Evolution toward a Nash equilibrium

In this paper, we study the dynamic behavior of Hedge, a well-known algo...
research
10/02/2022

Optimin achieves super-Nash performance

Since the 1990s, AI systems have achieved superhuman performance in majo...
research
02/02/2023

Learning in Multi-Memory Games Triggers Complex Dynamics Diverging from Nash Equilibrium

Repeated games consider a situation where multiple agents are motivated ...
research
03/25/2019

Probably Approximately Correct Nash Equilibrium Learning

We consider a multi-agent noncooperative game with agents' objective fun...
research
05/04/2022

Graphical Games for UAV Swarm Control Under Time-Varying Communication Networks

We propose a unified framework for coordinating Unmanned Aerial Vehicle ...
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