206 search results - page 20 / 42 » Computing Equilibria in Anonymous Games |
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
CSL
2009
Springer
14 years 1 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
WINE
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
ISAAC
2005
Springer
14 years 8 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
ATAL
2008
Springer
13 years 8 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...