206 search results - page 3 / 42 » Computing Equilibria in Anonymous Games |
MOR
2010
13 years 5 months ago
2010
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
DAGSTUHL
2007
13 years 8 months ago
2007
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...