scientific article; zbMATH DE number 3474804
From MaRDI portal
Publication:4057976
Cited in
(only showing first 100 items - show all)- Job search with related information and wage signalling
- Multi-armed bandits with simple arms
- Multi-armed bandits in discrete and continuous time
- Small-sample performance of Bernoulli two-armed bandit Bayesian strategies
- Optimal stopping problems for multiarmed bandit processes with arms' independence
- Stochastic scheduling and forwards induction
- 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.
- Herbert Robbins and sequential analysis
- Optimal learning and experimentation in bandit problems.
- A unified framework for stochastic optimization
- A common value experimentation with multiarmed bandits
- Optimal stopping for Brownian motion with applications to sequential analysis and option pricing
- Local information and the design of sequential hypothesis tests
- Optimal screening designs with flexible cost and constraint structures
- Coupled bisection for root ordering
- Index-based policies for discounted multi-armed bandits on parallel machines.
- Selecting among scheduled projects
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Gittins' theorem under uncertainty
- Dismemberment and design for controlling the replication variance of regret for the multi-armed bandit
- From reinforcement learning to optimal control: a unified framework for sequential decisions
- Matrices -- compensating the loss of anschauung
- Bandit and covariate processes, with finite or non-denumerable set of arms
- An adversarial model for scheduling with testing
- On the optimal amount of experimentation in sequential decision problems
- Choosing a good toolkit. I: Prior-free heuristics
- Choosing a good toolkit. II: Bayes-rule based heuristics
- Attributes
- Optimal selection of obsolescence mitigation strategies using a restless bandit model
- Multi-armed bandit processes with optimal selection of the operating times
- Scheduling of multi-class multi-server queueing systems with abandonments
- Nonparametric learning rules from bandit experiments: the eyes have it!
- The extraction of natural resources from two sites under uncertainty
- Online linear optimization and adaptive routing
- Using adaptive learning in credit scoring to estimate take-up probability distribution
- Pricing to accelerate demand learning in dynamic assortment planning for perishable products
- Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality
- 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
- Incentivizing exploration with heterogeneous value of money
- The multi-armed bandit, with constraints
- Derman's book as inspiration: some results on LP for MDPs
- Evaluating the effects of machine breakdowns in stochastic scheduling problems
- A bisection/successive approximation method for computing Gittins indices
- Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
- Bandit strategies evaluated in the context of clinical trials in rare life-threatening diseases
- Control: a perspective
- On the improvement of allocation rules for multi-armed bandit problem
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation
- Technical note -- A note on the equivalence of upper confidence bounds and Gittins indices for patient agents
- A general theory of multiarmed bandit processes with constrained arm switches
- A restless bandit model for resource allocation, competition, and reservation
- Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints
- MULTI-ARMED BANDITS WITH COVARIATES:THEORY AND APPLICATIONS
- Open Problem—M/G/1 Scheduling with Preemption Delays
- Optimal exploration-exploitation in a multi-armed bandit problem with non-stationary rewards
- Approximations to stochastic dynamic programs via information relaxation duality
- Optimal online learning for nonlinear belief models using discrete priors
- Simple Bayesian algorithms for best-arm identification
- scientific article; zbMATH DE number 7307478 (Why is no real title available?)
- An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits
- Optimizing a unimodal response function for binary variables
- Open bandit processes with uncountable states and time-backward effects
- Sensor scheduling for space object tracking and collision alert
- Multi-armed bandits under general depreciation and commitment
- Indexability and optimal index policies for a class of reinitialising restless bandits
- Explicit Gittins Indices for a Class of Superdiffusive Processes
- Generalized Bandit Problems
- Some best possible results for a discounted one armed bandit
- Learning while searching for the best alternative
- Simulation-based optimization of Markov decision processes: an empirical process theory approach
- 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
- Reinforcement Learning, Bit by Bit
- Empirical Gittins index strategies with -explorations for multi-armed bandit problems
- Consumer strategy, vendor strategy and equilibrium in duopoly markets with production costs
- Optimal Dynamic Information Acquisition
- A confirmation of a conjecture on Feldman’s two-armed bandit problem
- A stochastic differential equation driven by Poisson random measure and its application in a duopoly market
- Minimizing the time to a decision
- Ambiguity aversion in multi-armed bandit problems
- A Bayesian-bandit adaptive design for \(N\)-of-1 clinical trials
- Lévy bandits under Poissonian decision times
- Optimal switching between cash-flow streams
- An optimal selection for ensembles of influential projects
- Optimizing sequential decision-making under risk: strategic allocation with switching penalties
- Gradual learning from incremental actions
- Optimal allocation strategies in a discrete-time bandit problem
- Optimal learning for sequential sampling with non-parametric beliefs
- Optimal decision indices for R\&D project evaluation in the pharmaceutical industry: Pearson index versus Gittins index
- Combining multiple strategies for multiarmed bandit problems and asymptotic optimality
- Common value experimentation
- A more general Pandora rule?
- A perpetual search for talents across overlapping generations: a learning process
- Stochastic scheduling in an in-forest
- Allocation and scheduling of conditional task graphs
- Good news and bad news in two-armed bandits
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 Q4057976)
