Index policies for discounted bandit problems with availability constraints
From MaRDI portal
Publication:3516395
DOI10.1239/aap/1214950209zbMath1140.93047OpenAlexW2170585566WikidataQ56675683 ScholiaQ56675683MaRDI QIDQ3516395
Kazutoshi Yamazaki, Savas Dayanik, Warren B. Powell
Publication date: 5 August 2008
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1214950209
Related Items
Optimal selection of obsolescence mitigation strategies using a restless bandit model, Index policies for discounted bandit problems with availability constraints, Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation, Coupled bisection for root ordering, A General Theory of MultiArmed Bandit Processes with Constrained Arm Switches
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of the Gittins index theorem
- Restless bandits, partial conservation laws and indexability
- The Complexity of Optimal Queuing Network Control
- Scheduling stochastic jobs on a single machine subject to breakdowns
- Addendum to ‘On an index policy for restless bandits'
- Index policies for discounted bandit problems with availability constraints
- The Multi-Armed Bandit Problem: Decomposition and Computation
- Evaluating the effects of machine breakdowns in stochastic scheduling problems
- On an index policy for restless bandits
- Denumerable-Armed Bandits
- Switching Costs and the Gittins Index
- Incomplete Learning from Endogenous Data in Dynamic Allocation
- Index policies for a class of discounted restless bandits
- An index policy for a stochastic scheduling model with improving/deteriorating jobs
- On the optimal allocation of service to impatient tasks
- Some indexable families of restless bandit problems
