Simple search methods for finding a Nash equilibrium
AbstractWe present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2-player games and one for n-player games. Both algorithms bias the search towards supports that are small and balanced, and employ a backtracking procedure to efficiently explore these supports. Making use of a new comprehensive testbed, we test these algorithms on many classes of games, and show that they perform well against the state of the art--the Lemke-Howson algorithm for 2-player games, and Simplicial Subdivision and Govindan-Wilson for n-player games.
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 Elsevier in its journal Games and Economic Behavior.
Volume (Year): 63 (2008)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- McLennan, Andrew & Berg, Johannes, 2005. "Asymptotic expected number of Nash equilibria of two-player normal form games," Games and Economic Behavior, Elsevier, vol. 51(2), pages 264-295, May.
- C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
- Gilboa, Itzhak & Zemel, Eitan, 1989.
"Nash and correlated equilibria: Some complexity considerations,"
Games and Economic Behavior,
Elsevier, vol. 1(1), pages 80-93, March.
- Itzhak Gilboa & Eitan Zemel, 1988. "Nash and Correlated Equilibria: Some Complexity Considerations," Discussion Papers 777, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Rinott, Yosef & Scarsini, Marco, 2000. "On the Number of Pure Strategy Nash Equilibria in Random Games," Games and Economic Behavior, Elsevier, vol. 33(2), pages 274-293, November.
- McKelvey, Richard D. & McLennan, Andrew, 1996. "Computation of equilibria in finite games," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 2, pages 87-142 Elsevier.
- McKelvey, R.D. & McLennan, A., 1994.
"The Maximal Number of Regular Totaly Mixed Nash Equilibria,"
272, Minnesota - Center for Economic Research.
- McKelvey, Richard D. & McLennan, Andrew, 1997. "The Maximal Number of Regular Totally Mixed Nash Equilibria," Journal of Economic Theory, Elsevier, vol. 72(2), pages 411-425, February.
- McKelvey, Richard D. & McLennan, Andrew, 1994. "The Maximal Number of Regular Totally Mixed Nash Equilibria," Working Papers 865, California Institute of Technology, Division of the Humanities and Social Sciences.
- Govindan, Srihari & Wilson, Robert, 2003. "A global Newton method to compute Nash equilibria," Journal of Economic Theory, Elsevier, vol. 110(1), pages 65-86, May.
- Von Stengel, Bernhard, 2002. "Computing equilibria for two-person games," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 45, pages 1723-1759 Elsevier.
- Talman, A.J.J. & Laan, G. van der & Van der Heyden, L., 1987. "Variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using general labelling," Open Access publications from Tilburg University urn:nbn:nl:ui:12-153106, Tilburg University.
- Kohlberg, Elon & Mertens, Jean-Francois, 1986.
"On the Strategic Stability of Equilibria,"
Econometric Society, vol. 54(5), pages 1003-37, September.
- E. Kohlberg & J.-F. Mertens, 1998. "On the Strategic Stability of Equilibria," Levine's Working Paper Archive 445, David K. Levine.
- KOHLBERG, Elon & MERTENS, Jean-François, . "On the strategic stability of equilibria," CORE Discussion Papers RP -716, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Andrew McLennan & Rabee Tourky, 2008.
"Imitation Games and Computation,"
Discussion Papers Series
359, School of Economics, University of Queensland, Australia.
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
- Jiang, Albert Xin & Leyton-Brown, Kevin & Bhat, Navin A.R., 2011. "Action-Graph Games," Games and Economic Behavior, Elsevier, vol. 71(1), pages 141-173, January.
- Ruchira Datta, 2010. "Finding all Nash equilibria of a finite game using polynomial algebra," Economic Theory, Springer, vol. 42(1), pages 55-96, January.
- Godinho, Pedro & Dias, Joana, 2013. "Two-player simultaneous location game: Preferential rights and overbidding," European Journal of Operational Research, Elsevier, vol. 229(3), pages 663-672.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.