Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
From MaRDI portal
Publication:4895559
Recommendations
- scientific article; zbMATH DE number 1263282
- Restless bandits, partial conservation laws and indexability
- Almost optimal policies for stochastic systems which almost satisfy conservation laws
- Reflections on a New Approach to Gittins Indexation
- Index policies and a novel performance space structure for a class of generalized branching bandit problems
Cited in
(45)- On a new approach to the analysis of complex multi-armed bandits
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- A polyhedral approach to online bipartite matching
- Index-based policies for discounted multi-armed bandits on parallel machines.
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Efficiency in lung transplant allocation strategies
- Dynamic node packing
- Search and rescue in the face of uncertain threats
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
- Optimal schedule of elective surgery operations subject to disruptions by emergencies
- Restless bandits, partial conservation laws and indexability
- Stochastic scheduling with priority classes
- Index policies and a novel performance space structure for a class of generalized branching bandit problems
- Approximation algorithms for stochastic combinatorial optimization problems
- Decomposable Markov decision processes: A fluid optimization approach
- A Polyhedral Approach to Online Bipartite Matching
- Four proofs of Gittins' multiarmed bandit theorem
- THE ECONOMICS OF ATTENTION: MAXIMIZING USER VALUE IN INFORMATION-RICH ENVIRONMENTS
- The multi-armed bandit, with constraints
- Open bandit processes and optimal scheduling of queueing networks
- scientific article; zbMATH DE number 1263282 (Why is no real title available?)
- scientific article; zbMATH DE number 1060044 (Why is no real title available?)
- Optimal policies for observing time series and related restless bandit problems
- Solving convex optimization with side constraints in a multi-class queue by adaptive c rule
- On the optimal allocation of service to impatient tasks
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- Resource competition in virtual network embedding
- A restless bandit model for resource allocation, competition, and reservation
- Conditions for indexability of restless bandits and an algorithm to compute Whittle index
- Optimistic Gittins Indices
- Dynamic Relaxations for Online Bipartite Matching
- A verification theorem for threshold-indexability of real-state discounted restless bandits
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- QRF
- Open bandit processes with uncountable states and time-backward effects
- Simulation-based optimization of Markov decision processes: an empirical process theory approach
- Index policy for multiarmed bandit problem with dynamic risk measures
- Bayesian persuasion: reduced form approach
- Coordinated referral and scheduling decisions for specialized healthcare services
- A dual-index rule for managing temporary congestion
- Sequencing unreliable jobs on parallel machines
- Dynamic priority allocation via restless bandit marginal productivity indices
- A generalized Gittins index for a Markov chain and its recursive calculation
- Submodular function minimization
This page was built for publication: Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895559)
