• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Adaptive strategies and regret minimization in arbitrarily varying Markov environments (2001)

by Shie Mannor, Nahum Shimkin
Venue:In Proc. of 14th COLT
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

A general criterion and an algorithmic framework for learning in multi-agent systems

by Rob Powers, Yoav Shoham, Thuc Vu - Machine Learning , 2007
"... in multi-agent systems ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
in multi-agent systems

Hedged learning: regretminimization with learning experts

by Yu-han Chang, Leslie Pack Kaelbling - In ICML ’05: Proceedings of the 22nd international conference on Machine learning , 2005
"... In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimized for potential opponent models is proposed as a good framework for deciding how to behave in such situations. Using lon ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimized for potential opponent models is proposed as a good framework for deciding how to behave in such situations. Using longer playing horizons and experts that learn as they play, the regret-minimization framework can be extended to overcome several shortcomings of earlier approaches to the problem of multi-agent learning. 1.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University