Author

I. Ashlagi

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

How to Beat FCFS

We study two observable queues with identical service rates, serving agents who arrive stochastically over time. Agents join the queue that minimizes their expected waiting time. Assuming one queue uses the ubiquitous First-Come-First-Served (FCFS) service rule, we show that by simply modifying its service order, the o...

I. Ashlagi, Joseph Root · 0 citations