Pages that link to "Item:Q4895559"
From MaRDI portal
The following pages link to Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems (Q4895559):
Displayed 24 items.
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges (Q254442) (← links)
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- The multi-armed bandit, with constraints (Q378726) (← links)
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule (Q475118) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- Simulation-based optimization of Markov decision processes: an empirical process theory approach (Q608432) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- Dynamic priority allocation via restless bandit marginal productivity indices (Q926578) (← links)
- A generalized Gittins index for a Markov chain and its recursive calculation (Q945795) (← links)
- Submodular function minimization (Q995782) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- Index-based policies for discounted multi-armed bandits on parallel machines. (Q1872472) (← links)
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Decomposable Markov Decision Processes: A Fluid Optimization Approach (Q2957475) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- THE ECONOMICS OF ATTENTION: MAXIMIZING USER VALUE IN INFORMATION-RICH ENVIRONMENTS (Q3536022) (← links)
- (Q4633046) (← links)
- On the optimal allocation of service to impatient tasks (Q4819435) (← links)
- A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits (Q5119843) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- QRF (Q5270668) (← links)
- Open Bandit Processes with Uncountable States and Time-Backward Effects (Q5299564) (← links)