224 search results - page 24 / 45 » On Nash-Equilibria of Approximation-Stable Games |
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
SIGECOM
2004
ACM
14 years 29 days ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
AAAI
1998
13 years 9 months ago
1998
Reinforcement learning can provide a robust and natural means for agents to learn how to coordinate their action choices in multiagent systems. We examine some of the factors that...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Infinite-horizon multi-agent control processes with nondeterminism and partial state knowledge have particularly interesting properties with respect to adaptive control, ...
FMCO
2004
Springer
14 years 28 days ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...