4 search results - page 1 / 1 » Small Clique Detection and Approximate Nash Equilibria |
APPROX
2009
Springer
13 years 10 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
SAGT
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
PODC
2009
ACM
14 years 4 months ago
2009
ACM
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
SAGA
2007
Springer
13 years 10 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...