Pith. sign in

REVIEW 2 cited by

A Characterization of Universally Optimal Queueing Regimes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.13812 v4 pith:BMO4P2AZ submitted 2024-01-24 econ.TH cs.GTmath.PR

classification econ.THcs.GTmath.PR
keywords queueingoptimalregimesuniversallyefficientequilibriumcharacterizationmodel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider an M/M/s queueing model in which customers strategically decide, based on the service reward and waiting cost, whether to join upon arrival or balk and, at any time, whether to remain in the queue or renege. Rational strategic behavior yields an equilibrium whose outcome may be socially efficient or inefficient, depending on the queueing regime. Some regimes yield an efficient equilibrium only under precise calibration to the model parameters. Others are universally optimal, meaning that their equilibrium outcome is efficient for all parameter values. Universal optimality is therefore an appealing property for a planner choosing a queueing regime. We characterize the class of universally optimal queueing regimes. A by-product of our characterization is that preemption plays an unavoidable role in universally optimal regimes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How to Beat FCFS

    econ.TH 2026-08 accept novelty 7.0 of 10

    A strategically reordered "Ledger" queue attracts strictly more arrivals than a first-come-first-served competitor, with any work-conserving rule capped at about a 70.7% share.

  2. Strategic Queues with Priority Classes

    cs.GT 2025-02 conditional novelty 5.0 of 10

    In an M/M/1 queue where type-A customers have priority over type-B customers, the paper derives threshold strategies for joining and quitting at equilibrium and compares them with social optima.

Pith tools