research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:PNP
TitlePolynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
Bibtex cite IDRACTI-RU1-2006-1
Booktitle 2nd Workshop on Internet and Network Economics (WINE 2006)
Series Lecture Notes in Computer Science
Year published 2006
Month December
Volume 4286
Pages 286-296
Publisher Springer-Verlag
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for any bimatrix game in strongly polynomial time and we next show how to extend this algorithm so as to obtain a (potentially stronger) parameterized approximation. Namely, we present an algorithm that computes a 2+ 4 -Nash equilibrium, where is the minimum, among all Nash equilibria, expected payoff of either player. The suggested algorithm runs in time polynomial in the number of strategies available to the players.
Kontogiannis, Spyros
Panagopoulou, Panagiota
Spirakis, Paul
conference version.pdf (main file)
Short description of problem, previous work and result
Publication ID26