Efficient algorithms for online decision problems

[1]  Avrim Blum,et al.  Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary , 2004, COLT.

[2]  Baruch Awerbuch,et al.  Adaptive routing with end-to-end feedback: distributed learning and geometric approaches , 2004, STOC '04.

[3]  Martin Zinkevich,et al.  Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.

[4]  Baruch Awerbuch,et al.  Adapting to a reliable network path , 2003, PODC '03.

[5]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[6]  S. Vempala,et al.  Eecient Algorithms for Online Decision Problems , 2003 .

[7]  Manfred K. Warmuth,et al.  Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..

[8]  Adam Tauman Kalai,et al.  Static Optimality and Dynamic Search-Optimality in Lists and Trees , 2002, SODA '02.

[9]  Adam Tauman Kalai,et al.  Geometric algorithms for online optimization , 2002 .

[10]  Santosh S. Vempala,et al.  On Euclidean Embeddings and Bandwidth Minimization , 2001, RANDOM-APPROX.

[11]  Uriel Feige,et al.  Approximating the Bandwidth via Volume Respecting Embeddings , 2000, J. Comput. Syst. Sci..

[12]  Manfred K. Warmuth,et al.  Predicting nearly as well as the best pruning of a planar decision graph , 2002, Theor. Comput. Sci..

[13]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  Dean P. Foster,et al.  Regret in the On-Line Decision Problem , 1999 .

[15]  Satish Rao,et al.  Small distortion and volume preserving embeddings for planar and Euclidean metrics , 1999, SCG '99.

[16]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[17]  Uriel Feige,et al.  Approximating the bandwidth via volume respecting embeddings (extended abstract) , 1998, STOC '98.

[18]  Avrim Blum,et al.  On-line Learning and the Metrical Task System Problem , 1997, COLT '97.

[19]  Yoram Singer,et al.  Using and combining predictors that specialize , 1997, STOC '97.

[20]  Manfred K. Warmuth,et al.  How to use expert advice , 1997, JACM.

[21]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[22]  T. Cover.  Universal Portfolios , 1996 .

[23]  Avrim Blum,et al.  On-line Algorithms in Machine Learning , 1996, Online Algorithms.

[24]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[25]  Robert E. Schapire,et al.  Predicting Nearly As Well As the Best Pruning of a Decision Tree , 1995, COLT '95.

[26]  Nathan Linial,et al.  The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[27]  Neil D. Pearson,et al.  Consumption and Portfolio Policies With Incomplete Markets and Short‐Sale Constraints: the Finite‐Dimensional Case , 1991 .

[28]  Vladimir Vovk,et al.  Aggregating strategies , 1990, COLT '90.

[29]  Nick Littlestone,et al.  From on-line to batch learning , 1989, COLT '89.

[30]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[31]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[32]  Donald E. Knuth,et al.  Dynamic Huffman Coding , 1985, J. Algorithms.

[33]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[34]  R. Varga,et al.  Proof of Theorem 2 , 1983 .

[35]  James Hannan,et al.  4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .

[36]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .