Bounds for Regret-Matching Algorithms
暂无分享,去创建一个
[1] Yishay Mansour,et al. From External to Internal Regret , 2005, J. Mach. Learn. Res..
[2] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[3] Nicolò Cesa-Bianchi,et al. Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[4] Yoav Freund,et al. Game theory, on-line prediction and boosting , 1996, COLT '96.
[5] No-Regret Algorithms for Structured Prediction Problems , 2005 .
[6] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[7] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine Learning.
[8] Geoffrey J. Gordon. Regret bounds for prediction problems , 1999, COLT '99.
[9] D. Fudenberg,et al. Conditional Universal Consistency , 1999 .
[10] Ehud Lehrer,et al. A wide range no-regret theorem , 2003, Games Econ. Behav..
[11] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[12] Claudio Gentile,et al. The Robustness of the p-Norm Algorithms , 1999, COLT '99.
[13] H. Peyton Young,et al. Strategic Learning and Its Limits , 2004 .
[14] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[15] J. Shawe-Taylor. Potential-Based Algorithms in On-Line Prediction and Game Theory ∗ , 2001 .
[16] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[17] Yoram Singer,et al. Using and combining predictors that specialize , 1997, STOC '97.
[18] Andreu Mas-Colell,et al. A General Class of Adaptive Strategies , 1999, J. Econ. Theory.
[19] A. Greenwald,et al. Varieties of Regret in Online Prediction , 2004 .
[20] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .