Skip to content
Preprint

How to Beat FCFS

Aug 2026 · 0 citations
Economics

Abstract

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 other queue can capture a strict majority of the demand. We establish an upper bound on the arrival share any rule can capture against FCFS. When both queues can design their service order, we show a novel variant of Last-Come-First-Served (LCFS) is an equilibrium in a low congestion regime. Without commitment, the picture changes, and there is an equilibrium where both queues use FCFS, and agents route to the queue with the shorter waitlist.

View source

Similar papers

Preprint Sep 2026

Equilibrium Joining Strategies for Queues in Two-Phase Random Environment

We study equilibrium joining strategies in an M/M/1-type queueing system with strategic customers operating in a two-phase random environment described as a continuous-time Markov process. Strategic customers, upon arrival, choose whether to join or to balk based on available information and anticipated utility, consid...

Konstantin Avrachenkov, U. Yechiali · 0 citations
Preprint Sep 2026

Optimal Scheduling in Generalized Switch in Heavy Traffic

This work introduces the first policy to guarantee heavy-traffic optimal mean response time in the generalized switch, the Smallest Equalizing Bucket (SEB) policy, and proves SEB's heavy-traffic optimality.

Run-Han Xie, Ziv Scully, R. Righter et al. · 0 citations
Preprint Oct 2026

Age of Information in Queueing Systems with Merging Server Streams

We present a novel analytical framework for evaluating the age of information (AoI) in multi-path queueing topologies where output streams from multiple servers converge into a single pipeline. This theoretical scenario finds immediate application in ultra-reliable low-latency networks and edge computing architectures,...

Lucrezia Rossi, Leonardo Badia, Andrea Munari · 0 citations
Sep 2026

Early birds versus last-minute arrivals: Empirical evidence and theoretical analysis of arrival time queueing game

In this study, we examine a scenario where each customer strategically selects their arrival time at a queue, aiming to minimize their total costs, which include waiting, tardiness, and earliness costs. Building on the mixed strategy framework studied by Moshe Haviv, which provides a closed-form arrival time distribu...

Xiang-Jie Zhao, Yi-Chuan Ding, Dong-Dong Ge et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.