144 search results - page 8 / 29 » Computing Nash Equilibria of Action-Graph Games |
UAI
2001
13 years 8 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
TCS
2008
13 years 7 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
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. ...