SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive routing with end-to-end feedback
1 references·16 citing·33 second hopsampled
Adaptive routing with end-to-end feedback (2004)Adaptive routing with end-to-end feedbackGambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Gambling in a rigged casino: …Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (2019)Optimal Exploration–Exploitat…Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Bandit Convex Optimization fo…Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret (2012)Online Bandit Learning agains…Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Trading Regret for Efficiency…Introduction to Online Optimization (2011)Introduction to Online Optimi…Regret minimization and the price of total anarchy (2008)Regret minimization and the p…Competing in the dark: An efficient algorithm for bandit linear optimization (2008)Competing in the dark: An eff…Adapting to a Changing Environment: the Brownian Restless Bandits. (2008)Adapting to a Changing Enviro…The Price of Bandit Information for Online Optimization (2007)The Price of Bandit Informati…The on-line shortest path problem under partial monitoring (2007)The on-line shortest path pro…Online linear optimization and adaptive routing (2007)Online linear optimization an…Learning, Regret Minimization, and Equilibria (2007)Learning, Regret Minimization…Routing without regret (2006)Routing without regretFast convergence to Wardrop equilibria by adaptive sampling methods (2006)Fast convergence to Wardrop e…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…Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Online Learning with Predictable Sequences (2012)The best of both worlds: stochastic and adversarial bandits (2012)Online convex programming and generalized infinitesimal gradient ascent (2003)Logarithmic regret algorithms for online convex optimization (2007)Online Convex Optimization With Time-Varying Constraints and Bandit Feedback (2018)Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Mortal Multi-Armed Bandits (2008)Explore/Exploit Schemes for Web Content Optimization (2009)Approximation algorithms for restless bandit problems (2010)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Projection-free Online Learning (2012)Multi-armed bandits with application to 5G small cells (2016)Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit (2016)The Theory of Learning in Games (1998)Multiplicative updates outperform generic no-regret learning in congestion games (2009)Fast Convergence of Regularized Learning in Games (2015)Intrinsic Robustness of the Price of Anarchy (2015)An analog of the minimax theorem for vector payoffs (1956)Combinatorial Bandits Revisited (2015)Minimal Exploration in Structured Stochastic Bandits (2017)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Distributed Online Optimization With Long-Term Constraints (2021)Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization (2022)Multi-Armed Bandit Allocation Indices. (1990)Adaptive Game Playing Using Multiplicative Weights (1999)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Learning to Optimize via Information-Directed Sampling (2017)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem741 cited

Cited by

  • 2007Learning, Regret Minimization, and Equilibria183 cited
  • 2008Competing in the dark: An efficient algorithm for bandit linear optimization182 cited
  • 2007Online linear optimization and adaptive routing177 cited
  • 2004Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary172 cited
  • 2011Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints168 cited
  • 2007The Price of Bandit Information for Online Optimization161 cited
  • 2007The on-line shortest path problem under partial monitoring151 cited
  • 2008Adapting to a Changing Environment: the Brownian Restless Bandits.141 cited
  • 2018Bandit Convex Optimization for Scalable and Dynamic IoT Management139 cited
  • 2008Regret minimization and the price of total anarchy133 cited
  • 2006Routing without regret124 cited
  • 2012Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret121 cited
  • 2011Introduction to Online Optimization108 cited
  • 2019Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards

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

101 cited
  • 2006Fast convergence to Wardrop equilibria by adaptive sampling methods96 cited
  • 2006Approximation algorithms and online mechanisms for item pricing93 cited