Sciweavers

4 search results - page 1 / 1
» Computing Proper Equilibria of Zero-Sum Games
Sort
View
70
Voted
CG
2006
Springer
15 years 1 months ago
Computing Proper Equilibria of Zero-Sum Games
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 progra...
Peter Bro Miltersen, Troels Bjerre Sørensen
AAAI
2007
14 years 11 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
ESA
2010
Springer
236views Algorithms» more  ESA 2010»
14 years 10 months ago
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
Tobias Harks, Martin Hoefer, Max Klimm, Alexander ...
84
Voted
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...