119 search results - page 20 / 24 » The complexity of pure Nash equilibria |
91
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
EPIA
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we analyze the convergence of independent adaptive learners in repeated games. We show that, in this class of games, independent adaptive learners converge to pure Na...
82
Voted
SIGECOM
2003
ACM
15 years 2 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
77
Voted
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We propose a new class of game-theoretic models for network formation in which strategies are not directly related to edge choices, but instead correspond more generally to the ex...