Strategic Queues with Priority Classes
Computer Science and Game Theory
2025-02-11 v1 Probability
Abstract
We consider a strategic M/M/1 queueing model under a first-come-first-served regime, where customers are split into two classes and class has priority over class . Customers can decide whether to join the queue or balk, and, in case they have joined the queue, whether and when to renege. We study the equilibrium strategies and compare the equilibrium outcome and the social optimum in the two cases where the social optimum is or is not constrained by priority.
Cite
@article{arxiv.2502.05906,
title = {Strategic Queues with Priority Classes},
author = {Maurizio D'Andrea and Marco Scarsini},
journal= {arXiv preprint arXiv:2502.05906},
year = {2025}
}