Unit vector games

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

PDF - Accepted Version Restricted to Repository staff only until 27 January 2018. Download (418Kb)

• LSE expert's profile

• Published item via DOI

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
Library of Congress subject classification:	H Social Sciences > HB Economic Theory
Sets:	Departments > Mathematics
Funders:	Engineering and Physical Sciences Research Council
Projects:	EP/L011018/1
Date Deposited:	23 Feb 2016 16:12
URL:	http://eprints.lse.ac.uk/65506/

Actions (login required)

Record administration - authorised staff only