scientific article; zbMATH DE number 194374

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

stochastic scheduling Gittins index multi-armed bandit problem sequential allocation multi-population random sampling

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Sequential statistical design (62L05)

Related Items (only showing first 100 items - show all)

Optimal control of single-server queueing networks ⋮ A linear response bandit problem ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ Topp-Leone distribution with an application to binomial sampling ⋮ MULTI-ARMED BANDITS UNDER GENERAL DEPRECIATION AND COMMITMENT ⋮ Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems ⋮ Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards ⋮ Unnamed Item ⋮ Some indexable families of restless bandit problems ⋮ A survey of computational complexity results in systems and control ⋮ Learning in network contexts: experimental results from simulations ⋮ Dynamic Pricing with a Poisson Bandit Model ⋮ Learning while searching for the best alternative ⋮ Stationary multi-choice bandit problems. ⋮ Randomized allocation with arm elimination in a bandit problem with covariates ⋮ Simulation optimization: a review of algorithms and applications ⋮ Spinning plates and squad systems: policies for bi-directional restless bandits ⋮ Unnamed Item ⋮ Generalized Bandit Problems ⋮ Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards ⋮ Optimal learning and experimentation in bandit problems. ⋮ A Note on Optimal Strategies of a Generalized Two-Stage Bandit Problem ⋮ Two-Armed Bandit Strategies that Discount Past and Future ⋮ Applicable stochastic control: From theory to practice ⋮ Multi-armed bandit problem revisited ⋮ The performance of forwards induction policies ⋮ Woodroofe's one-armed bandit problem revisited ⋮ The optimal sequential information acquisition structure: a rational utility-maximizing perspective ⋮ Generalized two-stage bandit problem ⋮ Stochastic scheduling and forwards induction ⋮ Optimal selection of obsolescence mitigation strategies using a restless bandit model ⋮ Minimizing the mean slowdown in a single-server queue ⋮ Response-adaptive designs for clinical trials: simultaneous learning from multiple patients ⋮ Competing Markov decision processes ⋮ Incentivizing Exploration with Heterogeneous Value of Money ⋮ Multi-armed bandit processes with optimal selection of the operating times ⋮ Four proofs of Gittins' multiarmed bandit theorem ⋮ Stochastic scheduling of parallel queues with set-up costs ⋮ On the optimal allocation of service to impatient tasks ⋮ Technology diffusion by learning from neighbours ⋮ Self-confirming equilibrium and the Lucas critique ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ Optimal myopic policies and index policies for stochastic scheduling problems ⋮ Sequential allocation in clinical trials ⋮ The multi-armed bandit, with constraints ⋮ The system of quasi-variational inequalities attached to the two-armed bandit problem ⋮ One-armed bandit process with a covariate ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Zero-sum Games for Discrete-time Multi-armed Bandit Processes with a Generalized Discount ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ A statistical approach to adaptive problem solving ⋮ Bayesian bandits in clinical trials ⋮ An asymptotically optimal policy for finite support models in the multiarmed bandit problem ⋮ A Bayesian approach to the triage problem with imperfect classification ⋮ Customization of J. Bather's UCB strategy for a Gaussian multiarmed bandit ⋮ Recent sojourn time results for multilevel processor‐sharing scheduling disciplines ⋮ Optimal Bayesian strategies for the infinite-armed Bernoulli bandit ⋮ Two-parameter optimal stopping problem with switching costs ⋮ Optimal hysteresis for a class of deterministic deteriorating two-armed bandit problem with switching costs. ⋮ Branching bandits: A sequential search process with correlated pay-offs. ⋮ A dynamic programming strategy to balance exploration and exploitation in the bandit problem ⋮ A unified framework for stochastic optimization ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Herbert Robbins and sequential analysis ⋮ Ambiguity aversion in multi-armed bandit problems ⋮ Optimal strategies for a class of sequential control problems with precedence relations ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Randomized prediction of individual sequences ⋮ A second order SDE for the Langevin process reflected at a completely inelastic boundary ⋮ A program for sequential allocation of three Bernoulli populations ⋮ Unnamed Item ⋮ Generative adversarial networks are special cases of artificial curiosity (1990) and also closely related to predictability minimization (1991) ⋮ Reading policies for joins: an asymptotic analysis ⋮ A comparative study of ad hoc techniques and evolutionary methods for multi-armed bandit problems ⋮ Monotone Policies and Indexability for Bidirectional Restless Bandits ⋮ Reinforcement learning and evolutionary algorithms for non-stationary multi-armed bandit problems ⋮ A behavioral learning process in games ⋮ A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions ⋮ General notions of indexability for queueing control and asset management ⋮ Dynamic price competition ⋮ On the Gittins index in the M/G/1 queue ⋮ The prediction distribution for the heteroscedastic multivariate lineary models ⋮ Using adaptive learning in credit scoring to estimate take-up probability distribution ⋮ Index policies for the maintenance of a collection of machines by a set of repairmen ⋮ Sensitivity of the gittins index in the contiuous time two-armed bandit problem ⋮ Adaptive Incentive-Compatible Sponsored Search Auction ⋮ Infinite Arms Bandit: Optimality via Confidence Bounds ⋮ Independently Expiring Multiarmed Bandits ⋮ Tax problems in the undiscounted case ⋮ Customer Scheduling with Incomplete Information ⋮ Scheduling policies for an antiterrorist surveillance system ⋮ On index policies for stochastic minsum scheduling ⋮ Efficiency in lung transplant allocation strategies ⋮ A Bayesian Decision Approach for Sample Size Determination in Phase II Trials ⋮ Decision-Theoretic Designs for Phase II Clinical Trials Allowing for Competing Studies ⋮ Exploration-exploitation tradeoff using variance estimates in multi-armed bandits ⋮ Un ordonnancement dynamique de tâches stochastiques sur un seul processeur ⋮ Optimal allocation of simulation experiments in discrete stochastic optimization and approximative algorithms ⋮ PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING ⋮ On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes

This page was built for publication: