Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
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 quasi-linear preferences is rich enough.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kelly, Jerry S, 1977. "Strategy-Proofness and Social Choice Functions without Singlevaluedness," Econometrica, Econometric Society, vol. 45(2), pages 439-46, March.
- Maniquet, Francois, 2003.
"A characterization of the Shapley value in queueing problems,"
Journal of Economic Theory,
Elsevier, vol. 109(1), pages 90-103, March.
- Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- Lin Zhou & Stephen Ching, 2002. "Multi-valued strategy-proof social choice rules," Social Choice and Welfare, Springer, vol. 19(3), pages 569-580.
- Bossert, Walter, 1989. "On the extension of preferences over a set to the power set: An axiomatic characterization of a quasi-ordering," Journal of Economic Theory, Elsevier, vol. 49(1), pages 84-92, October.
- H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
- Gardenfors, Peter, 1976. "Manipulation of social choice functions," Journal of Economic Theory, Elsevier, vol. 13(2), pages 217-228, October.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Manipushpak Mitra, 2000.
"Achieving the First Best in Sequencing Problems,"
Bonn Econ Discussion Papers
bgse11_2001, University of Bonn, Germany.
- Kannai, Yakar & Peleg, Bezalel, 1984. "A note on the extension of an order on a set to the power set," Journal of Economic Theory, Elsevier, vol. 32(1), pages 172-175, February.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- François Maniquet & Yves Sprumont, 1999.
"Efficient strategy-proof allocation functions in linear production economies,"
Springer, vol. 14(3), pages 583-595.
- MANIQUET, François & SPRUMONT, Yves, 1998. "Efficient Strategy-Proof Allocation Functions in Linear Production Economies," Cahiers de recherche 9805, Universite de Montreal, Departement de sciences economiques.
- Feldman, Allan, 1979. "Manipulation and the Pareto rule," Journal of Economic Theory, Elsevier, vol. 21(3), pages 473-482, December.
- Carmen Bevia, 1996. "Identical preferences lower bound solution and consistency in economies with indivisible goods," Social Choice and Welfare, Springer, vol. 13(1), pages 113-126, January.
- Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
- Sprumont, Yves, 1991. "The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule," Econometrica, Econometric Society, vol. 59(2), pages 509-19, March.
- Barbera, Salvador & Dutta, Bhaskar & Sen, Arunava, 2005.
"Corrigendum to "Strategy-proof social choice correspondences" [J. Econ. Theory 101 (2001) 374-394],"
Journal of Economic Theory,
Elsevier, vol. 120(2), pages 275-275, February.
- Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-44, September.
- Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
- Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer, vol. 29(1), pages 151-162, September.
- Pattanaik, Prasanta K., 1973. "On the stability of sincere voting situations," Journal of Economic Theory, Elsevier, vol. 6(6), pages 558-574, December.
- Green, Jerry & Laffont, Jean-Jacques, 1977. "Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods," Econometrica, Econometric Society, vol. 45(2), pages 427-38, March.
- Jeroen Suijs, 1996. "On incentive compatibility and budget balancedness in public decision making," Review of Economic Design, Springer, vol. 2(1), pages 193-209, December.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:68:y:2010:i:1:p:220-232. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.