SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States
5 references·2 citing·28 second hop
Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States (2012)Adaptive Shortest-Path Routing under Unkn…Stochastic Linear Optimization Under Bandit Feedback (2008)Stochastic Linear Optimizatio…Online linear optimization and adaptive routing (2007)Online linear optimization an…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)Sample mean based index polic…Adaptive Treatment Allocation and the Multi-Armed Bandit Problem (1987)Adaptive Treatment Allocation…Matching While Learning (2021)Matching While LearningToward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack (2019)Toward Optimal Adaptive Onlin…Bandit Processes and Dynamic Allocation Indices (1979)Optimal Adaptive Policies for Sequential Allocation Problems (1996)On Bayesian Upper Confidence Bounds for Bandit Problems (2012)Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments (2017)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)The Nonstochastic Multiarmed Bandit Problem (2002)Online convex programming and generalized infinitesimal gradient ascent (2003)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)Contributions to the theory of games. (1960)How to use expert advice (1997)Algorithms for portfolio management based on the Newton method (2006)Combinatorial bandits (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)The assignment game I: The core (1971)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Dynamic Placement in Refugee Resettlement (2023)Some aspects of the sequential design of experiments (1952)Using confidence bounds for exploitation-exploration trade-offs (2003)Contextual Bandits with Linear Payoff Functions (2011)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Linearly Parameterized Bandits (2010)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)
this work references cited by second hop

References

  • 2004Efficient algorithms for online decision problems595 cited
  • 2008Stochastic Linear Optimization Under Bandit Feedback581 cited
  • 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
  • 1987Adaptive Treatment Allocation and the Multi-Armed Bandit Problem279 cited
  • 2007Online linear optimization and adaptive routing177 cited

Cited by

  • 2021Matching While Learning34 cited
  • 2019Toward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack27 cited

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