206 search results - page 16 / 42 » Computing Equilibria in Anonymous Games |
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
DFG
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
CONCUR
2007
Springer
14 years 27 days 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...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...