Library Header Image
LSE Research Online LSE Library Services

Enumeration of Nash equilibria for two-player games

Avis, David, Rosenberg, Gabriel D., Savani, Rahul and von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2010) Enumeration of Nash equilibria for two-player games. Economic Theory, 42 (1). pp. 9-37. ISSN 0938-2259

Full text not available from this repository.

Identification Number: 10.1007/s00199-009-0449-x


Abstract This paper describes algorithms for finding all Nash equilibria of a two-player game in strategic form. We present two algorithms that extend earlier work. Our presentation is self-contained, and explains the two methods in a unified framework using faces of best-response polyhedra. The first method lrsnash is based on the known vertex enumeration program lrs, for “lexicographic reverse search”. It enumerates the vertices of only one best-response polytope, and the vertices of the complementary faces that correspond to these vertices (if they are not empty) in the other polytope. The second method is a modification of the known EEE algorithm, for “enumeration of extreme equilibria”. We also describe a second, as yet not implemented, variant that is space efficient. We discuss details of implementations of lrsnash and EEE, and report on computational experiments that compare the two algorithms, which show that both have their strengths and weaknesses.

Item Type: Article
Official URL:
Additional Information: © 2009 Springer Verlag
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 24 Apr 2009 15:58
Last Modified: 16 May 2024 14:00

Actions (login required)

View Item View Item