Playing games with approximation algorithms
暂无分享,去创建一个
[1] Baruch Awerbuch,et al. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches , 2004, STOC '04.
[2] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[3] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[4] B. E. Eckbo,et al. Appendix , 1826, Epilepsy Research.
[5] Adam Tauman Kalai,et al. Online convex optimization in the bandit setting: gradient descent without a gradient , 2004, SODA '05.
[6] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[7] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[8] Thomas P. Hayes,et al. The Price of Bandit Information for Online Optimization , 2007, NIPS.
[9] Maria-Florina Balcan,et al. Approximation Algorithms and Online Mechanisms for Item Pricing , 2007, Theory Comput..
[10] Santosh S. Vempala,et al. A simple polynomial-time rescaling algorithm for solving linear programs , 2008, Math. Program..
[11] Robert D. Carr,et al. Randomized metarounding , 2002, Random Struct. Algorithms.
[12] Maria-Florina Balcan,et al. Approximation algorithms and online mechanisms for item pricing , 2006, EC '06.
[13] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[14] Thomas P. Hayes,et al. Robbing the bandit: less regret in online geometric optimization against an adaptive adversary , 2006, SODA '06.
[15] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[16] Thomas P. Hayes,et al. High-Probability Regret Bounds for Bandit Online Linear Optimization , 2008, COLT.
[17] Elad Hazan,et al. Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization , 2008, COLT.
[18] Avrim Blum,et al. Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary , 2004, COLT.
[19] Aranyak Mehta,et al. Design is as Easy as Optimization , 2006, SIAM J. Discret. Math..