Sciweavers

14 search results - page 2 / 3
» On the convergence of regret minimization dynamics in concav...
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
NIPS
2004
13 years 6 months ago
Convergence and No-Regret in Multiagent Learning
Learning in a multiagent system is a challenging problem due to two key factors. First, if other agents are simultaneously learning then the environment is no longer stationary, t...
Michael H. Bowling
ICML
2009
IEEE
14 years 5 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
ECCC
2007
180views more  ECCC 2007»
13 years 4 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
CORR
2008
Springer
172views Education» more  CORR 2008»
13 years 5 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik