Unit vector games

Savani, Rahul ORCID: 0000-0003-1262-7831 and von Stengel, Bernhard (2016) Unit vector games INTERNATIONAL JOURNAL OF ECONOMIC THEORY, 12 (1). pp. 7-27. ISSN 1742-7355, 1742-7363

Text unit.pdf - Author Accepted Manuscript Download (347kB)

Abstract

McLennan and Tourky 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 of bimatrix games where two basic equilibrium-finding algorithms take exponentially many steps: the Lemke-Howson algorithm, and support enumeration.

Item Type:	Article
Additional Information:	final version as published in IJET
Uncontrolled Keywords:	bimatrix game, Nash equilibrium computation, imitation game, Lemke-Howson algorithm, unit vector game
Depositing User:	Symplectic Admin
Date Deposited:	09 Oct 2017 07:38
Last Modified:	22 May 2026 23:25
DOI:	10.1111/ijet.12077
Related Websites:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3007822
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.