Branching Bandit Processes

DOI10.1017/S0269964800000826zbMath1134.91314MaRDI QIDQ3415889

Gideon Weiss

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (13)

Optimal control of single-server queueing networks ⋮ Open Bandit Processes with Uncountable States and Time-Backward Effects ⋮ Four proofs of Gittins' multiarmed bandit theorem ⋮ The multi-armed bandit, with constraints ⋮ Sample path methods in the control of queues ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Index policy for multiarmed bandit problem with dynamic risk measures ⋮ Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems ⋮ Optimal schedule of elective surgery operations subject to disruptions by emergencies ⋮ On the evaluation of strategies for branching bandit processes ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ A generalized Gittins index for a Markov chain and its recursive calculation ⋮ A General Theory of MultiArmed Bandit Processes with Constrained Arm Switches

Cites Work

• Unnamed Item
• Arm-acquiring bandits
• Multi-armed bandits with discount factor near one: The Bernoulli case
• Multiple feedback at a single-server station
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Extensions of the multiarmed bandit problem: The discounted case
• Linear Programming for Finite State Multi-Armed Bandit Problems
• A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index
• The Multi-Armed Bandit Problem: Decomposition and Computation
• Sensitivity Analysis for Stochastic Scheduling Problems
• Time-Sharing Service Systems. II
• Stochastic scheduling with order constraints
• A hamiltonian approach to optimal stochastic resource allocation
• On Bayesian models in stochastic scheduling
• Time-Sharing Service Systems. I

This page was built for publication: Branching Bandit Processes