49 search results - page 7 / 10 » Conjectural Equilibrium in Multiagent Learning |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
AAMAS
2007
Springer
13 years 7 months ago
2007
Springer
We consider a repeated Prisoner’s Dilemma game where two independent learning agents play against each other. We assume that the players can observe each others’ action but ar...
ECML
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
AAMAS
2006
Springer
13 years 7 months ago
2006
Springer
In this paper, we investigate Reinforcement learning (RL) in multi-agent systems (MAS) from an evolutionary dynamical perspective. Typical for a MAS is that the environment is not ...