scientific article
From MaRDI portal
Publication:4057976
zbMath0303.62064MaRDI QIDQ4057976
No author found.
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (93)
Index-based policies for discounted multi-armed bandits on parallel machines. ⋮ Optimal learning and experimentation in bandit problems. ⋮ Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints ⋮ A bisection/successive approximation method for computing Gittins indices ⋮ Job search with related information and wage signalling ⋮ Selecting among scheduled projects ⋮ Stochastic scheduling and forwards induction ⋮ Multi-armed bandits with simple arms ⋮ Evaluating the effects of machine breakdowns in stochastic scheduling problems ⋮ Open Bandit Processes with Uncountable States and Time-Backward Effects ⋮ Optimal selection of obsolescence mitigation strategies using a restless bandit model ⋮ Bandit and covariate processes, with finite or non-denumerable set of arms ⋮ Incentivizing Exploration with Heterogeneous Value of Money ⋮ Multi-armed bandit processes with optimal selection of the operating times ⋮ On Gittins' index theorem in continuous time ⋮ Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic ⋮ Four proofs of Gittins' multiarmed bandit theorem ⋮ Optimal decision indices for R\&D project evaluation in the pharmaceutical industry: Pearson index versus Gittins index ⋮ MULTI-ARMED BANDITS WITH COVARIATES:THEORY AND APPLICATIONS ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ Sensor Scheduling for Space Object Tracking and Collision Alert ⋮ The multi-armed bandit, with constraints ⋮ Derman's book as inspiration: some results on LP for MDPs ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Simulation-based optimization of Markov decision processes: an empirical process theory approach ⋮ Combining multiple strategies for multiarmed bandit problems and asymptotic optimality ⋮ Common value experimentation ⋮ A more general Pandora rule? ⋮ Index policy for multiarmed bandit problem with dynamic risk measures ⋮ Encounters with Martingales in Statistics and Stochastic Optimization ⋮ A central limit theorem, loss aversion and multi-armed bandits ⋮ A perpetual search for talents across overlapping generations: a learning process ⋮ Reinforcement Learning, Bit by Bit ⋮ MULTI-ARMED BANDITS UNDER GENERAL DEPRECIATION AND COMMITMENT ⋮ INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS ⋮ Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems ⋮ Consumer strategy, vendor strategy and equilibrium in duopoly markets with production costs ⋮ Optimal Dynamic Information Acquisition ⋮ Open Problem—M/G/1 Scheduling with Preemption Delays ⋮ Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards ⋮ A confirmation of a conjecture on Feldman’s two-armed bandit problem ⋮ Nonparametric learning rules from bandit experiments: the eyes have it! ⋮ An adversarial model for scheduling with testing ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ The extraction of natural resources from two sites under uncertainty ⋮ 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 unified framework for stochastic optimization ⋮ A common value experimentation with multiarmed bandits ⋮ Control: a perspective ⋮ Herbert Robbins and sequential analysis ⋮ Minimizing the time to a decision ⋮ Ambiguity aversion in multi-armed bandit problems ⋮ BANDIT STRATEGIES EVALUATED IN THE CONTEXT OF CLINICAL TRIALS IN RARE LIFE-THREATENING DISEASES ⋮ Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors ⋮ Simple Bayesian Algorithms for Best-Arm Identification ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ Online linear optimization and adaptive routing ⋮ Stochastic scheduling in an in-forest ⋮ Optimal switching between cash-flow streams ⋮ Optimal stopping for Brownian motion with applications to sequential analysis and option pricing ⋮ Local information and the design of sequential hypothesis tests ⋮ Allocation and scheduling of conditional task graphs ⋮ On the optimal amount of experimentation in sequential decision problems ⋮ Using adaptive learning in credit scoring to estimate take-up probability distribution ⋮ Optimal screening designs with flexible cost and constraint structures ⋮ Explicit Gittins Indices for a Class of Superdiffusive Processes ⋮ Some best possible results for a discounted one armed bandit ⋮ Coupled bisection for root ordering ⋮ Learning while searching for the best alternative ⋮ Good news and bad news in two-armed bandits ⋮ An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits ⋮ Pricing to accelerate demand learning in dynamic assortment planning for perishable products ⋮ Choosing a good toolkit. I: Prior-free heuristics ⋮ Choosing a good toolkit. II: Bayes-rule based heuristics ⋮ Optimal learning for sequential sampling with non-parametric beliefs ⋮ Un ordonnancement dynamique de tâches stochastiques sur un seul processeur ⋮ Generalized Bandit Problems ⋮ Optimizing a Unimodal Response Function for Binary Variables ⋮ Gittins' theorem under uncertainty ⋮ Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents ⋮ Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality ⋮ Dismemberment and design for controlling the replication variance of regret for the multi-armed bandit ⋮ Unnamed Item ⋮ Multi-armed bandits in discrete and continuous time ⋮ Small-sample performance of Bernoulli two-armed bandit Bayesian strategies ⋮ From reinforcement learning to optimal control: a unified framework for sequential decisions ⋮ Matrices -- compensating the loss of anschauung ⋮ Attributes ⋮ On the improvement of allocation rules for multi-armed bandit problem ⋮ A General Theory of MultiArmed Bandit Processes with Constrained Arm Switches ⋮ Optimal stopping problems for multiarmed bandit processes with arms' independence ⋮ A Restless Bandit Model for Resource Allocation, Competition, and Reservation
This page was built for publication:
