Cost-symmetric transfer rules for queueing with arrivals

DOI10.1016/J.MATHSOCSCI.2025.102416MaRDI QIDQ6916798zbMATH OpenFDO

Authors Changyong Han, Youngsub Chun

Publication date 14 October 2025

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.MATHSOCSCI.2025.102416

zbMATH Keywords

arrival queueing problemaxiomatic characterizationscost-symmetric max-transfer rulecost-symmetric min-transfer ruleequal treatment of equal costs

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Cooperative games (91A12) Mechanism design theory (91B03) Social choice (91B14)

Cites work

• A characterization of the Shapley value in queueing problems
• A characterization of the symmetrically balanced VCG rule in the queueing problem
• A pessimistic approach to the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Egalitarian equivalence and strategyproofness in the queueing problem
• Fair queueing
• Group strategyproofness in queueing models
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• No-envy in queueing problems
• Prior-free online mechanisms for queueing with arrivals
• Recent developments in the queueing problem
• The on-line transfer rule for queueing with arrivals
• Welfare lower bounds and strategy-proofness in the queueing problem

This page was built for publication: Cost-symmetric transfer rules for queueing with arrivals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6916798)