Sciweavers

25 search results - page 2 / 5
» Learning by demonstration in repeated stochastic games
Sort
View
AI
2007
Springer
13 years 11 months ago
Competition and Coordination in Stochastic Games
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
Andriy Burkov, Abdeslam Boularias, Brahim Chaib-dr...
ICML
2010
IEEE
13 years 6 months ago
Convergence, Targeted Optimality, and Safety in Multiagent Learning
This paper introduces a novel multiagent learning algorithm, Convergence with Model Learning and Safety (or CMLeS in short), which achieves convergence, targeted optimality agains...
Doran Chakraborty, Peter Stone
IJCAI
2001
13 years 6 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ICML
2008
IEEE
14 years 6 months ago
Strategy evaluation in extensive games with importance sampling
Typically agent evaluation is done through Monte Carlo estimation. However, stochastic agent decisions and stochastic outcomes can make this approach inefficient, requiring many s...
Michael H. Bowling, Michael Johanson, Neil Burch, ...
AI
2002
Springer
13 years 5 months ago
Multiagent learning using a variable learning rate
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
Michael H. Bowling, Manuela M. Veloso