139 citations · 314 across the 7 of their papers we have counts for
6 papers · 1 filter
Dynamic priority allocation via restless bandit marginal productivity indices
José Niño-Mora
This paper surveys recent work by the author on the theoretical and algorithmic aspects of restless bandit indexation as well as on its application to a variety of problems involvi…
A faster index algorithm and a computational study for bandits with switching costs
José Niño-Mora
We address the intractable multi-armed bandit problem with switching costs, for which Asawa and Teneketzis introduced in [M. Asawa and D. Teneketzis. 1996. Multi-armed bandits with…
A fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain
José Niño-Mora
This paper presents a new \emph{fast-pivoting} algorithm that computes the Gittins index values of an -state bandit -- in the discounted and undiscounted cases -- by perform…
Computing a classic index for finite-horizon bandits
José Niño-Mora
This paper considers the efficient exact computation of the counterpart of the Gittins index for a finite-horizon discrete-state bandit, which measures for each initial state the a…
Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policies
José Niño-Mora
Motivated by time-sensitive e-service applications, we consider the design of effective policies in a Markovian model for the dynamic control of both admission and routing of a sin…
Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies
José Niño-Mora
This paper considers a Markovian model for the optimal dynamic routing of homogeneous traffic to parallel heterogeneous queues, each having its own finite input buffer and server p…