SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Restless Bandit Formulation of Opportunistic Access: Indexablity and Index Policy
6 references·2 citing·25 second hop
A Restless Bandit Formulation of Opportunistic Access: Indexablity and Index Policy (2008)A Restless Bandit Formulation of Opportun…Whittle's index policy for a multi-class queueing system with convex holding costs (2003)Whittle's index policy for a …The complexity of optimal queueing network control (2002)The complexity of optimal que…Restless bandits, partial conservation laws and indexability (2001)Restless bandits, partial con…The Complexity of Optimal Queuing Network Control (1999)The Complexity of Optimal Que…On an index policy for restless bandits (1990)On an index policy for restle…Restless bandits: activity allocation in a changing world (1988)Restless bandits: activity al…Multi-Armed Bandits: Theory and Applications to Online Learning in Networks (2019)Multi-Armed Bandits: Theory a…Bandits Games and Clustering Foundations (2010)Bandits Games and Clustering …Priority Assignment in Waiting Line Problems (1954)Multi-Armed Bandit Problems (2007)Approximation algorithms for restless bandit problems (2010)Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics (2012)Brownian Motion and Stochastic Flow Systems. (1987)Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic (2000)Brownian Motion and Stochastic Calculus (2007)Relaxations of Weakly Coupled Stochastic Dynamic Programs (2008)Bandits with Knapsacks (2013)Bandit Processes and Dynamic Allocation Indices (1979)The Psychology and Neuroscience of Curiosity (2015)Bandit Algorithms (2020)An Introduction to Queueing Networks (1990)Why Copy Others? Insights from the Social Learning Strategies Tournament (2010)Social Choice and Individual Values (1952)Expected stock returns and volatility (1987)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Prediction with Limited Advice and Multiarmed Bandits with Paid Observations (2014)Optimally Confident UCB: Improved Regret for Finite-Armed Bandits (2015)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challenges (2015)Adapting to a Changing Environment: the Brownian Restless Bandits. (2008)Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challenges. (2015)
this work references cited by second hop

References

  • 1988Restless bandits: activity allocation in a changing world1,174 cited
  • 1990On an index policy for restless bandits486 cited
  • 1999The Complexity of Optimal Queuing Network Control470 cited
  • 2001Restless bandits, partial conservation laws and indexability202 cited
  • 2002The complexity of optimal queueing network control179 cited
  • 2003Whittle's index policy for a multi-class queueing system with convex holding costs109 cited

Cited by

  • 2010Bandits Games and Clustering Foundations47 cited
  • 2019Multi-Armed Bandits: Theory and Applications to Online Learning in Networks35 cited

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