No-envy, solidarity, and strategy-proofness in the queueing problem

Duygu Yengin and Youngsub Chun

Journal of Mathematical Economics, 2020, vol. 88, issue C, 87-97

Abstract: Given a group of agents, the queueing problem is concerned with finding the order to serve agents and the monetary transfers they should receive. In this paper, we characterize interesting subfamilies of the VCG mechanisms by investigating the implications of either no-envy or solidarity requirements. First, we present a characterization of the strategy-proofand envy-freemechanisms. Next, we present characterizations of VCG mechanisms satisfying one of two different formulations of cost monotonicity or population monotonicity. Finally, we show that among the envy-free and strategy-proof mechanisms, the only ones that satisfy one of two formulations of cost monotonicity or population monotonicity are extensions of the pivotal or the reward-based pivotal mechanisms.

Keywords: Queueing problem; No-envy; Strategy-proofness; Solidarity; VCG mechanism; Pivotal mechanism (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406820300343
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:88:y:2020:i:c:p:87-97

DOI: 10.1016/j.jmateco.2020.03.003

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().