Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game

Rahul Savani, Bernhard von Stengel. Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings. pages 258-267, IEEE Computer Society, 2004. [doi]

@inproceedings{SavaniS04,
  title = {Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game},
  author = {Rahul Savani and Bernhard von Stengel},
  year = {2004},
  url = {http://csdl.computer.org/comp/proceedings/focs/2004/2228/00/22280258abs.htm},
  researchr = {https://researchr.org/publication/SavaniS04},
  cites = {0},
  citedby = {0},
  pages = {258-267},
  booktitle = {45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2228-9},
}