Egalitarian equivalence and strategyproofness in the queueing problem

We investigate the implications of egalitarian equivalence (Pazner and Schmeidler in Q J Econ 92:671–687, <CitationRef CitationID="CR31">1978</CitationRef>) together with queue efficiency and strategyproofness in the context of queueing problems. We completely characterize the class of mechanisms satisfying the three requirements. Though there is no mechanism in this class satisfying budget balance, feasible mechanisms exist and we characterize the set of all such mechanisms. We also show that it is impossible to find a mechanism satisfying queue efficiency, egalitarian equivalence, and a stronger notion of strategyproofness called weak group strategyproofness. In addition, we show that generically there is no mechanism satisfying both egalitarian equivalence and no-envy. Copyright Springer-Verlag Berlin Heidelberg 2014