Pages that link to "Item:Q2999784"
From MaRDI portal
The following pages link to Approximation algorithms for restless bandit problems (Q2999784):
Displaying 14 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Regret bounds for restless Markov bandits (Q465253) (← links)
- Optimal Bayesian strategies for the infinite-armed Bernoulli bandit (Q643377) (← links)
- Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
- An online algorithm for the risk-aware restless bandit (Q2029383) (← links)
- Adaptive policies for perimeter surveillance problems (Q2286935) (← links)
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories (Q2935312) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- (Q3794059) (← links)
- Opportunistic Scheduling as Restless Bandits (Q4630229) (← links)
- Approximations of the Restless Bandit Problem (Q4633023) (← links)
- (Q4633046) (← links)
- Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
- Some indexable families of restless bandit problems (Q5395354) (← links)