A characterization of the symmetrically balanced VCG rule in the queueing problem

DOI10.1016/j.geb.2015.04.001zbMath1429.91074OpenAlexW2084718662MaRDI QIDQ2278940

Suresh Mutuswami, Manipushpak Mitra, Youngsub Chun

Publication date: 12 December 2019

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/A_characterization_of_the_symmetrically_balanced_VCG_rule_in_the_queueing_problem/10160522

zbMATH Keywords

axiomatic characterizationqueueing problemsimple proofsymmetrically balanced VCG rule

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Other game-theoretic models (91A40)

Related Items (8)

Incentives and justice for sequencing problems ⋮ A characterization of the Vickrey rule in slot allocation problems ⋮ Recent developments in the queueing problem ⋮ Balanced VCG mechanisms for sequencing problems ⋮ Reordering an existing queue ⋮ Allocating positions fairly: auctions and Shapley value ⋮ Prior-free online mechanisms for queueing with arrivals ⋮ No-envy in the Queueing Problem with Multiple Identical Machines

Cites Work

• Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
• Group strategyproofness in queueing models
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• A characterization of the Shapley value in queueing problems
• No-envy in queueing problems
• A pessimistic approach to the queueing problem
• Mechanism design in queueing problems

This page was built for publication: A characterization of the symmetrically balanced VCG rule in the queueing problem