Pages that link to "Item:Q926578"
From MaRDI portal
The following pages link to Dynamic priority allocation via restless bandit marginal productivity indices (Q926578):
Displaying 24 items.
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- Asymptotically optimal index policies for an abandonment queue with convex holding cost (Q747712) (← links)
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem (Q1007148) (← links)
- Optimal dynamic resource allocation to prevent defaults (Q1694773) (← links)
- A novel scheduling index rule proposal for QoE maximization in wireless networks (Q1724668) (← links)
- On the Whittle index of Markov modulated restless bandits (Q2095040) (← links)
- Dynamic control in multi-item production/inventory systems (Q2362241) (← links)
- Scheduling of multi-class multi-server queueing systems with abandonments (Q2398642) (← links)
- On the computation of Whittle's index for Markovian restless bandits (Q2661759) (← links)
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories (Q2935312) (← links)
- INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS (Q3585147) (← links)
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups (Q3616980) (← links)
- Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections (Q4571093) (← links)
- Monotone Policies and Indexability for Bidirectional Restless Bandits (Q4915650) (← links)
- Resource competition in virtual network embedding (Q4994071) (← links)
- Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (Q4994160) (← links)
- A Restless Bandit Model for Resource Allocation, Competition, and Reservation (Q5031019) (← links)
- Conditions for indexability of restless bandits and an algorithm to compute Whittle index (Q5055364) (← links)
- A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits (Q5119843) (← links)
- INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS (Q5358065) (← links)
- Minimizing the mean slowdown in the M/G/1 queue (Q6063268) (← links)
- Testing indexability and computing Whittle and Gittins index in subcubic time (Q6107877) (← links)
- Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems (Q6167036) (← links)
