Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
AbstractA 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 68 (2010)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Queueing problems Efficiency Fairness Strategy-proofness;
Other versions of this item:
- RAMAEKERS, Eve & KAYI, Cagatay, 2008. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," CORE Discussion Papers 2008084, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- KAYI, Cagatay & RAMAEKERS, Eve, . "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," CORE Discussion Papers RP -2179, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
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.:
- 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.
- Maniquet, F., 2000.
"A Characterization of the Shapley Value in Queueing Problems,"
222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- 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, François, . "A characterization of the Shapley value in queueing problems," CORE Discussion Papers RP -1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- François Maniquet & Yves Sprumont, 1999. "Efficient strategy-proof allocation functions in linear production economies," Economic Theory, Springer, vol. 14(3), pages 583-595.
- Manipushpak Mitra, 2002.
"Achieving the first best in sequencing problems,"
Review of Economic Design,
Springer, vol. 7(1), pages 75-91.
- 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.
- 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.
- Feldman, Allan, 1979. "Manipulation and the Pareto rule," Journal of Economic Theory, Elsevier, vol. 21(3), pages 473-482, 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.
- Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
- H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
- 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.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Lin Zhou & Stephen Ching, 2002. "Multi-valued strategy-proof social choice rules," Social Choice and Welfare, Springer, vol. 19(3), pages 569-580.
- 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.
- 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.
- Barbera, Salvador & Dutta, Bhaskar & Sen, Arunava, 2001. "Strategy-proof Social Choice Correspondences," Journal of Economic Theory, Elsevier, vol. 101(2), pages 374-394, December.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Egalitarian Equivalence And Strategyproofness In The Queueing Problem," Discussion Papers in Economics 13/16, Department of Economics, University of Leicester.
- Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer, vol. 38(3), pages 473-480, March.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
- Kayi, Ãağatay & Ramaekers, Eve, 2008.
"An Impossibility in Sequencing Problems,"
040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.