Advanced Search
MyIDEAS: Login to save this article or follow this journal

Group strategyproofness in queueing models

Contents:

Author Info

  • Mitra, Manipushpak
  • Mutuswami, Suresh

Abstract

We 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 Info

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.
File URL: http://www.sciencedirect.com/science/article/B6WFW-50G0687-1/2/1655dadc8dbe49b61d2a97351c4e60b3
Download Restriction: Full text for ScienceDirect subscribers only

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 Info

Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 72 (2011)
Issue (Month): 1 (May)
Pages: 242-254

as in new window
Handle: RePEc:eee:gamebe:v:72:y:2011:i:1:p:242-254

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

Related research

Keywords: Queueing models Group strategyproofness Efficiency No deficit;

Other versions of this item:

References

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.:
as in new window
  1. Manipushpak Mitra, 2000. "Achieving the First Best in Sequencing Problems," Bonn Econ Discussion Papers bgse11_2001, University of Bonn, Germany.
  2. Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
  3. Manipushpak Mitra, 2001. "Mechanism design in queueing problems," Economic Theory, Springer, vol. 17(2), pages 277-305.
  4. Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
  5. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-44, September.
  6. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
  7. Shigehiro Serizawa, 2005. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," ISER Discussion Paper 0629, Institute of Social and Economic Research, Osaka University.
  8. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, 01.
  9. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
  10. Moulin, H., 1986. "Characterizations of the pivotal mechanism," Journal of Public Economics, Elsevier, vol. 31(1), pages 53-78, October.
  11. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
  12. 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.
  13. Mutuswami, Suresh, 2005. "Strategyproofness, Non-Bossiness and Group Strategyproofness in a cost sharing model," Economics Letters, Elsevier, vol. 89(1), pages 83-88, October.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
  2. Conan Mukherjee, 2013. "Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines," International Journal of Game Theory, Springer, vol. 42(1), pages 131-163, February.
  3. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
  4. 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.
  5. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
  6. 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.
  7. Kayi, Çağatay & Ramaekers, Eve, 2008. "An Impossibility in Sequencing Problems," Research Memorandum 040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  8. 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).
  9. Conan Mukherjee, 2014. "Fair and group strategy-proof good allocation with money," Social Choice and Welfare, Springer, vol. 42(2), pages 289-311, February.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:72:y:2011:i:1:p:242-254. 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 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.