The Multi-Armed Bandit Problem: Decomposition and Computation
From MaRDI portal
Recommendations
Cited in
(80)- The learning component of dynamic allocation indices
- On a new approach to the analysis of complex multi-armed bandits
- Stochastic scheduling and forwards induction
- A common value experimentation with multiarmed bandits
- A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
- Enhancing gene expression programming based on space partition and jump for symbolic regression
- An optimal stopping policy for car rental businesses with purchasing customers
- Robust control of the multi-armed bandit problem
- The performance of forwards induction policies
- Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality
- Competing Markov decision processes
- Ameso optimization: a relaxation of discrete midpoint convexity
- Optimal learning with non-Gaussian rewards
- Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- Computing a classic index for finite-horizon bandits
- A faster index algorithm and a computational study for bandits with switching costs
- The Irrevocable Multiarmed Bandit Problem
- Optimal stopping of Markov chains and three abstract optimization problems
- scientific article; zbMATH DE number 7038557 (Why is no real title available?)
- Partially observed Markov decision process multiarmed bandits-structural results
- 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
- Continue, quit, restart probability model
- Perspectives of approximate dynamic programming
- On Solving Finite State Multi-Armed Bandit Problem by Linear Programming
- Tax problems in the undiscounted case
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
- Index Policies for Shooting Problems
- Branching Bandit Processes
- Incentivizing exploration with heterogeneous value of money
- Index policies for discounted bandit problems with availability constraints
- Extensions of the multiarmed bandit problem: The discounted case
- A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index
- The multi-armed bandit, with constraints
- Derman's book as inspiration: some results on LP for MDPs
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- A bisection/successive approximation method for computing Gittins indices
- Denumerable-Armed Bandits
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem
- Dynamic allocation policies for the finite horizon one armed bandit problem
- The \(K\)-armed dueling bandits problem
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- Survey of linear programming for standard and nonstandard Markovian control problems. Part II: Applications
- The Nonstochastic Multiarmed Bandit Problem
- 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
- A Structured Multiarmed Bandit Problem and the Greedy Policy
- scientific article; zbMATH DE number 7380836 (Why is no real title available?)
- Optimistic Gittins Indices
- A verification theorem for threshold-indexability of real-state discounted restless bandits
- The efficacy of league formats in ranking teams
- Optimal online learning for nonlinear belief models using discrete priors
- An Approximation Approach for Response-Adaptive Clinical Trial Design
- Optimal control of single-server queueing networks
- Multi-armed bandits under general depreciation and commitment
- DES and RES processes and their explicit solutions
- Asymptotically optimal multi-armed bandit policies under a cost constraint
- Risk-Sensitive and Risk-Neutral Multiarmed Bandits
- Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds
- Finite-time analysis of the multiarmed bandit problem
- Optimal activation of halting multi‐armed bandit models
- Index policy for multiarmed bandit problem with dynamic risk measures
- Testing indexability and computing Whittle and Gittins index in subcubic time
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
- Empirical Gittins index strategies with -explorations for multi-armed bandit problems
- Consumer strategy, vendor strategy and equilibrium in duopoly markets with production costs
- A stochastic differential equation driven by Poisson random measure and its application in a duopoly market
- Percentile optimization in multi-armed bandit problems
- On the sensitivity of restless bandits solutions to uncertainty in the models of the arms
- An optimal selection for ensembles of influential projects
- A dynamic roy model of academic specialization
- A reinforcement learning approach for resolving inconsistencies in qualitative constraint networks
- Rule-based knowledge graph completion (invited paper)
- City streets parking enforcement inspection decisions: the Chinese postman's perspective
- On the resolution of misspecified convex optimization and monotone variational inequality problems
- Adaptive approaches to stochastic programming
- A perpetual search for talents across overlapping generations: a learning process
- A generalized Gittins index for a Markov chain and its recursive calculation
This page was built for publication: The Multi-Armed Bandit Problem: Decomposition and Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755256)
