activity
20112022
most citedAsymptotically optimal priority policies for indexable and nonindexable restless bandits

96 citations · 103 across the 5 of their papers we have counts for

collaborators

5 papers

cs.PF2022★ 1 cited

Efficient scheduling in redundancy systems with general service times

Elene Anton, Rhonda Righter, Ina Maria Maaike Verloop

We characterize the impact of scheduling policies on the mean response time in nested systems with cancel-on-complete redundancy. We consider not only redundancy-oblivious policies…

math.OC2019★ 1 cited

A unifying computations of Whittle's Index for Markovian bandits

Urtzi Ayesta, Manu K. Gupta, Ina Maria Verloop

The multi-armed restless bandit framework allows to model a wide variety of decision-making problems in areas as diverse as industrial engineering, computer communication, operatio…

math.PR2016★ 96 cited

Asymptotically optimal priority policies for indexable and nonindexable restless bandits

I. M. Verloop

We study the asymptotic optimal control of multi-class restless bandits. A restless bandit is a controllable stochastic process whose state evolution depends on whether or not the…

math.PR2015★ 2 cited

Markov-modulated M/G/1 type queue in heavy traffic and its application to time-sharing disciplines

H. Thorsdottir, I. M. Verloop

This paper deals with a single-server queue with modulated arrivals, service requirements and service capacity. In our first result, we derive the mean of the total workload assumi…

cs.PF2011★ 3 cited

Scheduling in a random environment: stability and asymptotic optimality

U. Ayesta, M. Erausquin, M. Jonckheere +1

We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and…