Hard-to-Solve Bimatrix Games
AbstractThe Lemke-Howson algorithm is the classical method for finding one Nash equilibrium of a bimatrix game. This paper presents a class of square bimatrix games for which this algorithm takes, even in the best case, an exponential number of steps in the dimension d of the game. Using polytope theory, the games are constructed using pairs of dual cyclic polytopes with 2d suitably labeled facets in d-space. The construction is extended to nonsquare games where, in addition to exponentially long Lemke-Howson computations, finding an equilibrium by support enumeration takes on average exponential time. Copyright The Econometric Society 2006.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Econometric Society in its journal Econometrica.
Volume (Year): 74 (2006)
Issue (Month): 2 (03)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer, vol. 37(2), pages 185-201, June.
- Srihari Govindan & Robert Wilson, 2010.
"A decomposition algorithm for N-player games,"
Springer, vol. 42(1), pages 97-117, January.
- Morales, Dolores Romero & Vermeulen, Dries, 2009.
"Existence of equilibria in a decentralized two-level supply chain,"
European Journal of Operational Research,
Elsevier, vol. 197(2), pages 642-658, September.
- Morales, Dolores Romero & Vermeulen, Dries, 2009. "Existence of equilibria in a decentralized two-level supply chain," Open Access publications from Maastricht University urn:nbn:nl:ui:27-23092, Maastricht University.
- Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer, vol. 42(1), pages 193-236, January.
- Andrew McLennan & Rabee Tourky, 2008.
"Imitation Games and Computation,"
Discussion Papers Series
359, School of Economics, University of Queensland, Australia.
- Luciano De Castro, 2012. "Correlation of Types in Bayesian Games," Discussion Papers 1556, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- McLennan, Andrew & Tourky, Rabee, 2008. "Games in oriented matroids," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 807-821, July.
- Sobel, Joel, 2009. "ReGale: Some memorable results," Games and Economic Behavior, Elsevier, vol. 66(2), pages 632-642, July.
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.