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

Bruno Codenotti, Mauro Leoncini, Giovanni Resta. Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. In Yossi Azar, Thomas Erlebach, editors, Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Volume 4168 of Lecture Notes in Computer Science, pages 232-243, Springer, 2006. [doi]

@inproceedings{CodenottiLR06,
  title = {Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games},
  author = {Bruno Codenotti and Mauro Leoncini and Giovanni Resta},
  year = {2006},
  doi = {10.1007/11841036_23},
  url = {http://dx.doi.org/10.1007/11841036_23},
  researchr = {https://researchr.org/publication/CodenottiLR06},
  cites = {0},
  citedby = {0},
  pages = {232-243},
  booktitle = {Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings},
  editor = {Yossi Azar and Thomas Erlebach},
  volume = {4168},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-38875-3},
}