No-regret learning in convex games
暂无分享,去创建一个
[1] Geoffrey J. Gordon,et al. Approximate solutions to markov decision processes , 1999 .
[2] Geoffrey J. Gordon. Regret bounds for prediction problems , 1999, COLT '99.
[3] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[4] B. Stengel,et al. Computationally efficient coordination in game trees , 2002 .
[5] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[6] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[7] Corinna Cortes,et al. Support-Vector Networks , 1995, Machine Learning.
[8] Yoram Singer,et al. Convex Repeated Games and Fenchel Duality , 2006, NIPS.
[9] Geoffrey J. Gordon. No-regret Algorithms for Online Convex Programs , 2006, NIPS.
[10] Elad Hazan,et al. Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria , 2007, NIPS.
[11] Yishay Mansour,et al. From External to Internal Regret , 2005, J. Mach. Learn. Res..
[12] Gábor Lugosi,et al. Learning correlated equilibria in games with compact sets of strategies , 2007, Games Econ. Behav..
[13] Casey Marks. No-Regret Learning and Game-Theoretic Equilibria , 2008 .