Unit vector games

von Stengel, Bernhard ORCID: 0000-0002-3488-8322 and Savani, Rahul (2016) Unit vector games. International Journal of Economic Theory, 12 (1). pp. 7-27. ISSN 1742-7363

Preview

PDF - Accepted Version Download (428kB) | Preview

• Author

Abstract

McLennan and Tourky (2010) showed that “imitation games” provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke–Howson algorithm. In an imitation game, the payoff matrix of one of the players is the identity matrix. We study the more general “unit vector games”, which are already known, where the payoff matrix of one player is composed of unit vectors. Our main application is a simplification of the construction by Savani and von Stengel (2006) of bimatrix games where two basic equilibrium-finding algorithms take exponentially many steps: the Lemke–Howson algorithm, and support enumeration.

Item Type:	Article
Official URL:	http://onlinelibrary.wiley.com/journal/10.1111/(IS...
Additional Information:	© 2016 The International Association for Economic Theory
Divisions:	Mathematics
Subjects:	H Social Sciences > HB Economic Theory
Date Deposited:	23 Feb 2016 16:12
Last Modified:	14 Sep 2024 07:03
Projects:	EP/L011018/1
Funders:	Engineering and Physical Sciences Research Council
URI:	http://eprints.lse.ac.uk/id/eprint/65506

Actions (login required)

View Item