SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stochastic Online Shortest Path Routing: The Value of Feedback
16 references·0 citing·31 second hop
Stochastic Online Shortest Path Routing: The Value of Feedback (2017)Stochastic Online Shortest Path Routing: …Combinatorial Bandits Revisited (2015)Combinatorial Bandits Revisit…Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits (2014)Tight Regret Bounds for Stoch…Thompson Sampling for Complex Online Problems (2014)Thompson Sampling for Complex…Regret in Online Combinatorial Optimization (2013)Regret in Online Combinatoria…Combinatorial Multi-Armed Bandit: General Framework and Applications (2013)Combinatorial Multi-Armed Ban…Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…Combinatorial bandits (2012)Combinatorial banditsThe KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond (2011)The KL-UCB Algorithm for Boun…On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)On Upper-Confidence Bound Pol…Near-optimal Regret Bounds for Reinforcement Learning (2010)Near-optimal Regret Bounds fo…The on-line shortest path problem under partial monitoring (2007)The on-line shortest path pro…Algorithmic Game Theory (2007)Algorithmic Game TheoryAdaptive routing with end-to-end feedback (2004)Adaptive routing with end-to-…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Asymptotically efficient allo…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Bandit Processes and Dynamic Allocation Indices (1979)Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Optimistic bayesian sampling in contextual-bandit problems (2012)Bandits With Heavy Tail (2013)KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Prediction, Learning, and Games (2006)Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis (2012)Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (2014)Chasing Demand: Learning and Earning in a Changing Environment (2016)The Nonstochastic Multiarmed Bandit Problem (2002)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Confronting Deep Uncertainties in Risk Analysis (2012)A Tutorial on Thompson Sampling (2018)A Stochastic Approximation Method (1951)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Using confidence bounds for exploitation-exploration trade-offs (2003)Stochastic Linear Optimization Under Bandit Feedback (2008)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Decentralized Learning for Multiplayer Multiarmed Bandits (2014)Cascading Bandits: Learning to Rank in the Cascade Model (2015)Efficient algorithms for online decision problems (2004)From Bandits to Experts: On the Value of Side-Observations (2011)The Continuum-Armed Bandit Problem (1995)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Society-in-the-loop: programming the algorithmic social contract (2017)Agent-Based Modeling in Economics and Finance: Past, Present, and Future (2025)Combinatorial Pure Exploration of Multi-Armed Bandits (2014)Efficient learning by implicit exploration in bandit problems with side observations (2026)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2007Algorithmic Game Theory2,416 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
  • 2011On Upper-Confidence Bound Policies for Switching Bandit Problems455 cited
  • 2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
  • 2013Combinatorial Multi-Armed Bandit: General Framework and Applications392 cited
  • 2011The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond363 cited
  • 1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited
  • 2012Combinatorial bandits320 cited
  • 2013Regret in Online Combinatorial Optimization210 cited
  • 2004Adaptive routing with end-to-end feedback190 cited
  • 2014Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits155 cited
  • 2007The on-line shortest path problem under partial monitoring151 cited
  • 2014Thompson Sampling for Complex Online Problems128 cited

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

  • 2015Combinatorial Bandits Revisited124 cited
  • Cited by

    No citing works inside the corpus for this window.