SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Playing games with approximation algorithms
12 references·5 citing·25 second hop
Playing games with approximation algorithms (2007)Playing games with approximation algorith…High-probability regret bounds for bandit online linear optimization (2008)High-probability regret bound…Competing in the dark: An efficient algorithm for bandit linear optimization (2008)Competing in the dark: An eff…The Price of Bandit Information for Online Optimization (2007)The Price of Bandit Informati…Robbing the bandit: less regret in online geometric optimization against an adaptive adversary (2006)Robbing the bandit: less regr…Approximation algorithms and online mechanisms for item pricing (2006)Approximation algorithms and …Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary (2004)Online Geometric Optimization…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Adaptive routing with end-to-end feedback (2004)Adaptive routing with end-to-…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Contributions to the Theory of Games. (1959)Contributions to the Theory o…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Fair Assortment Planning (2022)Fair Assortment PlanningOnline Submodular Maximization under a Matroid Constraint with Application to Learning Assignments (2014)Online Submodular Maximizatio…Sharp Dichotomies for Regret Minimization in Metric Spaces (2010)Sharp Dichotomies for Regret …Online Learning with Global Cost Functions (2009)Online Learning with Global C…Multi-armed bandits in metric spaces (2008)Multi-armed bandits in metric…The Nonstochastic Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Online Learning and Online Convex Optimization (2011)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Introduction to Online Convex Optimization (2016)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Bandit Algorithms (2020)A Method of Sampling Inspection (1929)Experimental Determination of the Maximum of a Function (1941)A Stochastic Approximation Method (1951)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Introduction to Stochastic Programming (2011)INTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL (2012)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Introduction to Multi-Armed Bandits (2019)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)The Theory of Learning in Games (1998)A Simple Adaptive Procedure Leading to Correlated Equilibrium (2000)Contributions to the theory of games. (1960)How to use expert advice (1997)Online Learning and Online Convex Optimization (2012)Equilibrium in supergames with the overtaking criterion (1979)Introduction to game theory (2003)Robust Dynamic Programming (2005)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,789 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient642 cited
  • 2004Efficient algorithms for online decision problems601 cited
  • 1959Contributions to the Theory of Games.311 cited
  • 2004Adaptive routing with end-to-end feedback190 cited
  • 2008Competing in the dark: An efficient algorithm for bandit linear optimization182 cited
  • 2004Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary172 cited
  • 2007The Price of Bandit Information for Online Optimization161 cited
  • 2006Approximation algorithms and online mechanisms for item pricing93 cited
  • 2006Robbing the bandit: less regret in online geometric optimization against an adaptive adversary71 cited
  • 2008High-probability regret bounds for bandit online linear optimization66 cited

Cited by

  • 2008Multi-armed bandits in metric spaces392 cited
  • 2009Online Learning with Global Cost Functions28 cited
  • 2014Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

27 cited
  • 2010Sharp Dichotomies for Regret Minimization in Metric Spaces26 cited
  • 2022Fair Assortment Planning12 cited