Sciweavers

64 search results - page 10 / 13
» Learning to commit in repeated games
Sort
View
ATAL
2008
Springer
13 years 9 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
LAMAS
2005
Springer
14 years 14 days ago
Multi-agent Relational Reinforcement Learning
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice ...
EUROCOLT
1995
Springer
13 years 10 months ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire
ATAL
2011
Springer
12 years 7 months ago
Using iterated reasoning to predict opponent strategies
The field of multiagent decision making is extending its tools from classical game theory by embracing reinforcement learning, statistical analysis, and opponent modeling. For ex...
Michael Wunder, Michael Kaisers, John Robert Yaros...
ICML
2003
IEEE
14 years 7 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich