Dynamic priority allocation via restless bandit marginal productivity indices
From MaRDI portal
Publication:926578
DOI10.1007/s11750-007-0025-0zbMath1142.90015OpenAlexW2135063910MaRDI QIDQ926578
Publication date: 20 May 2008
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-007-0025-0
restless banditsindex policiesdynamic control of queuescontrol by priceindexabilitymarginal productivity index
Communication networks in operations research (90B18) Queues and service in operations research (90B22) Inventory, storage, reservoirs (90B05) Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)
Related Items (24)
Dynamic control in multi-item production/inventory systems ⋮ Conditions for indexability of restless bandits and an algorithm to compute Whittle index ⋮ Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections ⋮ Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories ⋮ On the computation of Whittle's index for Markovian restless bandits ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ Testing indexability and computing Whittle and Gittins index in subcubic time ⋮ Optimal dynamic resource allocation to prevent defaults ⋮ INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS ⋮ Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems ⋮ A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits ⋮ A novel scheduling index rule proposal for QoE maximization in wireless networks ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ Monotone Policies and Indexability for Bidirectional Restless Bandits ⋮ INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS ⋮ A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups ⋮ Linear programming relaxations and marginal productivity index policies for the buffer sharing problem ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost ⋮ Resource competition in virtual network embedding ⋮ Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach ⋮ On the Whittle index of Markov modulated restless bandits ⋮ A Restless Bandit Model for Resource Allocation, Competition, and Reservation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
- A distributional form of Little's law
- Optimality of the shortest line discipline with state-dependent service rates
- Multi-armed bandits with discount factor near one: The Bernoulli case
- On the Gittins index for multiarmed bandits
- Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
- Optimization of static traffic allocation policies
- Combining make to order and make to stock
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- A multiobjective control approach to priority queues
- Optimal hysteresis for a class of deterministic deteriorating two-armed bandit problem with switching costs.
- Numerical linear algebra algorithms and software
- Two approaches to optimal routing and admission control in systems with real-time traffic
- Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information
- ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES
- Restless bandits, partial conservation laws and indexability
- The Complexity of Optimal Queuing Network Control
- A (2/3)n3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain
- A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs
- On the duality between routing and scheduling systems with finite buffer space
- Joining the right queue: a state-dependent decision rule
- Scheduling for Minimum Total Loss Using Service Time Distributions
- On Sequential Designs for Maximizing the Sum of $n$ Observations
- Addendum to ‘On an index policy for restless bandits'
- On the Optimality of the Generalized Shortest Queue Policy
- Optimal priority assignment: a time sharing approach
- Optimal intensity control of a queueing system with state-dependent capacity limit
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Optimal control of admission to a quenching system
- Extensions of the multiarmed bandit problem: The discounted case
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- On the optimal assignment of servers and a repairman
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- On an index policy for restless bandits
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- Dynamic Scheduling of a Multiclass Make-to-Stock Queue
- Optimality of the shortest line discipline
- Time-Sharing Service Systems. I
- Dynamic server allocation to parallel queues with randomly varying connectivity
- Switching Costs and the Gittins Index
- ERROR BOUNDS FOR CALCULATION OF THE GITTINS INDICES
- Dynamic Scheduling Rules for a Multiproduct Make-to-Stock Queue
- ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
- Multi-armed bandits with switching penalties
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Discrete Dynamic Programming
- Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues
- Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
- A conservation law for a wide class of queueing disciplines
- Scheduling with Random Service Times
- A relation between stationary queue and waiting time distributions
- Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points
This page was built for publication: Dynamic priority allocation via restless bandit marginal productivity indices
