Computing proper equilibria of zero-sum games

Authors:
Peter Bro Miltersen;Troels Bjerre Sørensen
Affiliations:
Department of Computer Science-Daimi, University of Aarhus, Denmark;Department of Computer Science-Daimi, University of Aarhus, Denmark
Venue:
CG'06 Proceedings of the 5th international conference on Computers and games
Year:
2006

Citing 5
Cited 3

Fast algorithms for finding randomized strategies in game trees

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Representations and solutions for game-theoretic problems

Artificial Intelligence - Special issue on economic principles of multi-agent systems
The concept of proper solution in linear programming

Journal of Optimization Theory and Applications
Computing sequential equilibria for two-player games

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating game-theoretic optimal strategies for full-scale poker

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Computing a proper equilibrium of a bimatrix game

Proceedings of the 13th ACM Conference on Electronic Commerce
Optimal patrol strategy for protecting moving targets with multiple mobile resources

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Protecting moving targets with multiple mobile resources

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

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.