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:
TitlePolynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
Bibtex cite IDRACTI-RU1-2009-86
Booktitle Theoretical Computer Science
Year published 2009
Volume 410
Pages 1599-1606
Keywords Bimatrix game,Approximate Nash equilibrium
We focus on the problem of computing an epsilon (Porson)-Nash equilibrium of a bimatrix game, when epsilon (Porson) is an absolute constant. We present a simple algorithm for computing a View the MathML source-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 View the MathML source-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
darticle.pdf (main file)
Publication ID753