scientific article; zbMATH DE number 3638998
From MaRDI portal
Publication:4197923
Cited in
(only showing first 100 items - show all)- Risk aversion in expected intertemporal discounted utilities bandit problems
- Learning, risk attitude and hot stoves in restless bandit problems
- A Bayesian analysis of human decision-making on bandit problems
- An optimal stopping time problem with time average cost in a bounded interval
- Multi-armed bandits with simple arms
- Assessing the effects of machine breakdowns in stochastic scheduling
- Bernoulli two-armed bandits with geometric termination
- On the evaluation of fixed permutations as strategies in stochastic scheduling
- Algorithms for evaluating the dynamic allocation index
- On optimal search with unknown detection probabilities
- On the evaluation of strategies for branching bandit processes
- A model of experimentation with information externalities
- On scheduling influential stochastic tasks on a single machine
- Discrete multiarmed bandits and multiparameter processes
- Optimal stopping problems for multiarmed bandit processes with arms' independence
- Parallel search for the best alternative
- Stochastic scheduling and forwards induction
- Bounds on optimal values in stochastic scheduling
- An application of Edgeworth expansion in Bayesian inferences: Optimal sample sizes in clinical trials
- Branching bandits: A sequential search process with correlated pay-offs.
- Sequential process control under capacity constraints.
- Optimal learning and experimentation in bandit problems.
- A Bayesian adaptive design for clinical trials in rare diseases
- Decomposing risk in an exploitation-exploration problem with endogenous termination time
- A unified framework for stochastic optimization
- A novel scheduling index rule proposal for QoE maximization in wireless networks
- Optimal learning before choice
- On Bayesian index policies for sequential resource allocation
- Optimal stopping for Brownian motion with applications to sequential analysis and option pricing
- Index policies for the maintenance of a collection of machines by a set of repairmen
- A survey of Markov decision models for control of networks of queues
- Selecting among scheduled projects
- Selecting jobs for scheduling on a machine subject to failure
- Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Regret bounds for sleeping experts and bandits
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
- Player-compatible learning and player-compatible equilibrium
- Gittins' theorem under uncertainty
- Dismemberment and design for controlling the replication variance of regret for the multi-armed bandit
- Matrices -- compensating the loss of anschauung
- Learning theorem proving components
- Bandit and covariate processes, with finite or non-denumerable set of arms
- Robust experimentation in the continuous time bandit problem
- Control, cost, and confidence: perseverance and procrastination in the face of failure
- The multi-armed bandit problem: an efficient nonparametric solution
- Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Dynamic survival bias in optimal stopping problems
- On the optimal amount of experimentation in sequential decision problems
- On index policies for stochastic minsum scheduling
- On the dynamic allocation of assets subject to failure
- Asymptotically optimal algorithms for budgeted multiple play bandits
- On the almost sure convergence of adaptive allocation procedures
- Optimal discrete search with technological choice
- Dynamic decision making for graphical models applied to oil exploration
- Algorithmic aspects of mean-variance optimization in Markov decision processes
- The performance of forwards induction policies
- Multi-armed bandit processes with optimal selection of the operating times
- Rational status quo
- Arbitrary side observations in bandit problems
- Using adaptive learning in credit scoring to estimate take-up probability distribution
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
- Experimentation and project selection: screening and learning
- Competing Markov decision processes
- On Gittins' index theorem in continuous time
- Online collaborative filtering on graphs
- A simulation-based approach to stochastic dynamic programming
- Approximate dynamic programming based on high dimensional model representation
- Approximation algorithms for stochastic combinatorial optimization problems
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- Infomax strategies for an optimal balance between exploration and exploitation
- A forwards induction approach to candidate drug selection
- Response-adaptive designs for clinical trials: simultaneous learning from multiple patients
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
- Four proofs of Gittins' multiarmed bandit theorem
- Tax problems in the undiscounted case
- Bayesian Incentive-Compatible Bandit Exploration
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
- Index policies for discounted bandit problems with availability constraints
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- The multi-armed bandit, with constraints
- Derman's book as inspiration: some results on LP for MDPs
- The expected asymptotical ratio for preemptive stochastic online problem
- General time consistent discounting
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy
- A Bayesian approach to the triage problem with imperfect classification
- Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
- Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections
- Learning the distribution with largest mean: two bandit frameworks
- Finite-time analysis for the knowledge-gradient policy
- Bandit strategies evaluated in the context of clinical trials in rare life-threatening diseases
- Regret bounds for restless Markov bandits
- Survey of linear programming for standard and nonstandard Markovian control problems. Part II: Applications
- 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
- Monotone policies and indexability for bidirectional restless bandits
- When to abandon a research project and search for a new one
- Learning unknown service rates in queues: a multiarmed bandit approach
- A general theory of multiarmed bandit processes with constrained arm switches
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197923)
