14 citations · 43 across the 11 of their papers we have counts for
12 papers
Can a Weaker Player Win? Adaptive Play in Repeated Games
Jonatha ANSELMI, Bruno Gaujal
Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let…
Non-Stationary Gradient Descent for Optimal Auto-Scaling in Serverless Platforms
Jonatha Anselmi, Bruno Gaujal, Louis-Sebastien Rebuffi
To efficiently manage serverless computing platforms, a key aspect is the auto-scaling of services, i.e., the set of computational resources allocated to a service adapts over time…
Balanced Splitting: A Framework for Achieving Zero-wait in the Multiserver-job Model
Jonatha Anselmi, Josu Doncel
We present a new framework for designing nonpreemptive and job-size oblivious scheduling policies in the multiserver-job queueing model. The main requirement is to identify a stati…
Learning Optimal Admission Control in Partially Observable Queueing Networks
Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi
We present an efficient reinforcement learning algorithm that learns the optimal admission control policy in a partially observable queueing network. Specifically, only the arrival…
Load Balancing with Job-Size Testing: Performance Improvement or Degradation?
Jonatha Anselmi, Josu Doncel
In the context of decision making under explorable uncertainty, scheduling with testing is a powerful technique used in the management of computer systems to improve performance vi…
Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space
Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi
In this paper, we revisit the regret of undiscounted reinforcement learning in MDPs with a birth and death structure. Specifically, we consider a controlled queue with impatient jo…
Asynchronous Load Balancing and Auto-scaling: Mean-Field Limit and Optimal Design
Jonatha Anselmi
We develop a Markovian framework for load balancing that combines classical algorithms such as Power-of- with auto-scaling mechanisms that allow the net service capacity to scal…
Stability and Optimization of Speculative Queueing Networks
Jonatha Anselmi, Neil Walton
We provide a queueing-theoretic framework for job replication schemes based on the principle "\emph{replicate a job as soon as the system detects it as a \emph{straggler}}". This i…
Power-of--Choices with Memory: Fluid Limit and Optimality
Jonatha Anselmi, Francois Dufour
In multi-server distributed queueing systems, the access of stochastically arriving jobs to resources is often regulated by a dispatcher, also known as load balancer. A fundamental…
Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
Jonatha Anselmi, Bruno Gaujal, Tommaso Nesti
We consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental pr…
Ergodic transition in a simple model of the continuous double auction
Tijana Radivojević, Jonatha Anselmi, Enrico Scalas
We study a phenomenological model for the continuous double auction, equivalent to two independent queues. The continuous double auction defines a continuous-time random wa…
Closed queueing networks under congestion: non-bottleneck independence and bottleneck convergence
Jonatha Anselmi, Bernardo D'Auria, Neil Walton
We analyze the behavior of closed product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus…