234 search results - page 5 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
SAGT
2009
Springer
15 years 2 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
101
click to vote
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
CG
2006
Springer
15 years 1 months ago
2006
Springer
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...
AAAI
2004
14 years 11 months ago
2004
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...