Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games

@inproceedings{Codenotti2006EfficientCO,
  title={Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games},
  author={Bruno Codenotti and Mauro Leoncini and Giovanni Resta},
  booktitle={ESA},
  year={2006}
}
It is known that finding a Nash equilibrium for win-lose bimatrix games, i.e., two-player games where the players’ payoffs are zero and one, is complete for the class PPAD. We describe a linear time algorithm which computes a Nash equilibrium for win-lose bimatrix games where the number of winning positions per strategy of each of the players is at most two. The algorithm acts on the directed graph that represents the zero-one pattern of the payoff matrices describing the game. It is based upon… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Equilibrium points in bimatrix games

  • C. E. Lemke, J. T. Howson
  • Journal of the Society for Industrial and Applied…
  • 1964

Non-Cooperative Games, Annals of Mathematics

  • J. Nash
  • 1951
1 Excerpt

Similar Papers

Loading similar papers…