Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

Download PDF
Open Webpage

Spyros C. Kontogiannis, Paul G. Spirakis

Published: 2007, Last Modified: 09 May 2025ICALP 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constructing Nash Equilibria (NE in short) in polynomial time, even for bimatrix games, understanding the limitations of the approximability of the problem is of great importance.