Computing Proper Equilibria of Zero-Sum Games

Abstract

We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear programs of roughly the same dimensions as the standard linear programs describing the Nash equilibria of the game. 
DOI: 10.1007/978-3-540-75538-8_18

2 Figures and Tables

Topics

  • Presentations referencing similar topics