Egalitarian Equivalence And Strategyproofness In The Queueing Problem

We investigate the implications of egalitarian equivalence (Pazner and Schmeidler [22]) 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. 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 two normative notions, egalitarian equivalence and no-envy, together.