A Restless Bandit Model for Resource Allocation, Competition, and Reservation
From MaRDI portal
Publication:5031019
DOI10.1287/opre.2020.2066zbMath1484.91225arXiv1804.02100OpenAlexW3136386349MaRDI QIDQ5031019
Jing Fu, Peter G. Taylor, William Moran
Publication date: 18 February 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.02100
Stochastic models in economics (91B70) Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies
- Asymptotically optimal priority policies for indexable and nonindexable restless bandits
- Asymptotically optimal index policies for an abandonment queue with convex holding cost
- Near optimal control of queueing networks over a finite time horizon
- Dynamic priority allocation via restless bandit marginal productivity indices
- Loss networks
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization
- Home health care routing and scheduling: a review
- Asymptotic optimality of tracking policies in stochastic networks.
- Restless bandits, partial conservation laws and indexability
- The Complexity of Optimal Queuing Network Control
- Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics
- Multi‐Armed Bandit Allocation Indices
- Random Perturbations of Dynamical Systems
- Optimal control of queueing networks: an approach via fluid models
- Basics of Applied Stochastic Processes
- On an index policy for restless bandits
- Whittle Index Policy for Crawling Ephemeral Content
- Structured Threshold Policies for Dynamic Sensor Scheduling—A Partially Observed Markov Decision Process Approach
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- An Infinite Server System with General Packing Constraints
- Large-scale heterogeneous service systems with general packing constraints
- Scheduling Continuous-Time Kalman Filters
- Control Techniques for Complex Networks
