On an index policy for restless bandits

From MaRDI portal
Publication:3970272

DOI10.2307/3214547zbMath0735.90072OpenAlexW2044502527MaRDI QIDQ3970272

Gideon Weiss, Richard R. Weber

Publication date: 25 June 1992

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214547




Related Items (44)

Stochastic scheduling and forwards inductionConditions for indexability of restless bandits and an algorithm to compute Whittle indexDynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic OptimalityResource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristicFour proofs of Gittins' multiarmed bandit theoremOn the optimal allocation of service to impatient tasksDynamic routing in distinguishable parallel queues: an application of product returns for remanufacturingScheduling of multi-class multi-server queueing systems with abandonmentsGeneralized Restless Bandits and the Knapsack Problem for Perishable InventoriesOn the computation of Whittle's index for Markovian restless banditsMulti-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approachTesting indexability and computing Whittle and Gittins index in subcubic timeMULTI-ARMED BANDITS UNDER GENERAL DEPRECIATION AND COMMITMENTINDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITSExponential asymptotic optimality of Whittle index policyA confirmation of a conjecture on Feldman’s two-armed bandit problemIndex policies for discounted bandit problems with availability constraintsA mean field approach for optimization in discrete timeA Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Banditsr-extreme signalling for congestion controlDynamic priority allocation via restless bandit marginal productivity indicesMYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUEGroup Maintenance: A Restless Bandits ApproachBANDIT STRATEGIES EVALUATED IN THE CONTEXT OF CLINICAL TRIALS IN RARE LIFE-THREATENING DISEASESSome indexable families of restless bandit problemsStochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocationAttack allocation on remote state estimation in multi-systems: structural results and asymptotic solutionMonotone Policies and Indexability for Bidirectional Restless BanditsDynamic resource allocation in a multi-product make-to-stock production systemINDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYSGeneral notions of indexability for queueing control and asset managementIndex policies for the maintenance of a collection of machines by a set of repairmenIndependently Expiring Multiarmed BanditsAn asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action banditsGrid Brokering for Batch Allocation Using IndexesAsymptotically optimal index policies for an abandonment queue with convex holding costTwo-Armed Restless Bandits with Imperfect Information: Stochastic Control and IndexabilitySpinning plates and squad systems: policies for bi-directional restless banditsResource competition in virtual network embeddingOn the Whittle index of Markov modulated restless banditsUnnamed ItemMulti-armed bandit models for the optimal design of clinical trials: benefits and challengesWhittle index based Q-learning for restless bandits with average rewardA Restless Bandit Model for Resource Allocation, Competition, and Reservation







This page was built for publication: On an index policy for restless bandits