3 papers
cs.GT2026
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…
math.OC2025
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…
cs.PF2024
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…