Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
(2010) Games and Economic Behavior — Vol. 68, n° 1, p. 220-232 (2010)
Files
Rep2179.pdf
Restricted Access - Adobe PDF
- 483.06 KB
Details
- Authors
- Abstract
- A set of agents with possibly different waiting costs have to receive the same service one after the other. Efficiency requires to maximize total welfare. Fairness requires to treat equal agents equally. One must form a queue, set up monetary transfers to compensate agents having to wait, and not a priori arbitrarily exclude agents from positions. As one may not know agents’ waiting costs, they may have no incentive to reveal them. We identify the only rule satisfying Pareto-efficiency, equal treatment of equals in welfare or symmetry, and strategy-proofness. It satisfies stronger axioms, as no-envy and anonymity. Further, its desirability extends to related problems. To obtain these results, we prove that a rule, single-valued or not, satisfies queue-efficiency and strategy-proofness if and only if it always selects efficient queues and sets transfers à la Groves [Groves, T., 1973. Incentives in teams. Econometrica 41, 617–631]. This holds in other problems, provided the domain of quasilinear preferences is rich enough.
- Affiliations
Universiteit Maastricht Department of Economics
Citations
Kayi, Ç., & Ramaekers, E. (2010). Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems. Games and Economic Behavior, 68(1), 220-232. https://doi.org/10.1016/j.geb.2009.07.003 (Original work published 2010)