Group strategyproofness in queueing models
AbstractWe identify and characterize a natural and intuitive class of mechanisms called the k-pivotal mechanisms. The axioms used are efficiency, pairwise strategyproofness, equal treatment of equals and weak linearity. We also identify the subclass of these mechanisms which do not run a budget deficit at all profiles and the mechanism which runs the least budget surplus. We also show that while k-pivotal mechanisms are also weak group strategyproof, strong group strategyproofness and efficiency are incompatible.
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): 72 (2011)
Issue (Month): 1 (May)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Queueing models Group strategyproofness Efficiency No deficit;
Other versions of this item:
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.:
- 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.
- Mitra, Manipushpak, 2005.
"Incomplete information and multiple machine queueing problems,"
European Journal of Operational Research,
Elsevier, vol. 165(1), pages 251-266, August.
- Manipushpak Mitra, 2001. "Incomplete Information and Multiple Machine Queueing Problems," Bonn Econ Discussion Papers bgse19_2001, University of Bonn, Germany.
- Shigehiro Serizawa, 2005.
"Pairwise Strategy-Proofness and Self-Enforcing Manipulation,"
ISER Discussion Paper
0629, Institute of Social and Economic Research, Osaka University.
- Shigehiro Serizawa, 2006. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," Social Choice and Welfare, Springer, vol. 26(2), pages 305-331, April.
- Moulin, Herve & Bogomolnaia, Anna, 2001.
"Random Matching under Dichotomous Preferences,"
2001-03, Rice University, Department of Economics.
- Moulin, H., 1986. "Characterizations of the pivotal mechanism," Journal of Public Economics, Elsevier, vol. 31(1), pages 53-78, October.
- Manipushpak Mitra, 2001.
"Mechanism design in queueing problems,"
Springer, vol. 17(2), pages 277-305.
- Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Manipushpak Mitra, 2002.
"Achieving the first best in sequencing problems,"
Review of Economic Design,
Springer, vol. 7(1), pages 75-91.
- William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
- 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.
- Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
- Mutuswami, Suresh, 2005. "Strategyproofness, Non-Bossiness and Group Strategyproofness in a cost sharing model," Economics Letters, Elsevier, vol. 89(1), pages 83-88, October.
- 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," Research Memoranda 040, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP).
- 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. "Egalitarian Equivalence And Strategyproofness In The Queueing Problem," Discussion Papers in Economics 13/16, Department of Economics, University of Leicester.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.