The following pages link to (Q3815845):
Displaying 50 items.
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges (Q254442) (← links)
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- Whittle index approach to size-aware scheduling for time-varying channels with multiple states (Q335893) (← links)
- Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies (Q339718) (← links)
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy (Q420791) (← links)
- Regret bounds for restless Markov bandits (Q465253) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- Dynamic resource allocation in a multi-product make-to-stock production system (Q543557) (← links)
- General notions of indexability for queueing control and asset management (Q549860) (← links)
- Attack allocation on remote state estimation in multi-systems: structural results and asymptotic solution (Q680517) (← links)
- Asymptotically optimal index policies for an abandonment queue with convex holding cost (Q747712) (← links)
- Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue (Q855181) (← links)
- A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
- Dynamic priority allocation via restless bandit marginal productivity indices (Q926578) (← links)
- An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition (Q948651) (← links)
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem (Q1007148) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- Theoretical tools for understanding and aiding dynamic decision making (Q1042309) (← links)
- Learning, risk attitude and hot stoves in restless bandit problems (Q1042312) (← links)
- Stochastic scheduling and forwards induction (Q1346693) (← links)
- Branching bandits: A sequential search process with correlated pay-offs. (Q1421893) (← links)
- Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization (Q1634077) (← links)
- A Bayesian adaptive design for clinical trials in rare diseases (Q1658148) (← links)
- Optimal dynamic resource allocation to prevent defaults (Q1694773) (← links)
- A novel scheduling index rule proposal for QoE maximization in wireless networks (Q1724668) (← links)
- Index policies for the maintenance of a collection of machines by a set of repairmen (Q1776971) (← links)
- Coupled bisection for root ordering (Q1785734) (← links)
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
- Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies (Q1926787) (← links)
- An online algorithm for the risk-aware restless bandit (Q2029383) (← links)
- Efficiency in lung transplant allocation strategies (Q2044231) (← links)
- Gittins' theorem under uncertainty (Q2076662) (← links)
- On the Whittle index of Markov modulated restless bandits (Q2095040) (← links)
- Whittle indexability in egalitarian processor sharing systems (Q2095212) (← links)
- Robust control of the multi-armed bandit problem (Q2095215) (← links)
- Whittle index based Q-learning for restless bandits with average reward (Q2116660) (← links)
- Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach (Q2177821) (← links)
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities (Q2216197) (← links)
- The role of information in system stability with partially observable servers (Q2218828) (← links)
- On the Gittins index in the M/G/1 queue (Q2269488) (← links)
- On the dynamic allocation of assets subject to failure (Q2301960) (← links)
- Algorithmic aspects of mean-variance optimization in Markov decision processes (Q2356186) (← links)
- Dynamic control in multi-item production/inventory systems (Q2362241) (← links)
- Optimal selection of obsolescence mitigation strategies using a restless bandit model (Q2379539) (← links)
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing (Q2393118) (← links)
- Scheduling of multi-class multi-server queueing systems with abandonments (Q2398642) (← links)
- Using adaptive learning in credit scoring to estimate take-up probability distribution (Q2497272) (← links)
- Dynamic routing to heterogeneous collections of unreliable servers (Q2641948) (← links)
