Advanced Search
MyIDEAS: Login

Group Strategyproofness in Queueing Models

Contents:

Author Info

  • Manipushpak Mitra
  • Suresh Mutuswami

    ()

Abstract

We examine the tradeoffs between two variants of group strategyproofness, efficiency and budget balance in queueing models. In general, group strategyproofness is incompatible with efficiency and budget balance. Weakening budget balance to feasibility, we show that the incompatibility persists with strong group strategyproofness. We then identify a necessary condition for weak group strategyproofness and efficiency and use it to show that these two requirements are incompatible with budget balance unless there are exactly three agents. We also demonstrate the compatibility when there are three agents. Finally, we identify a class of efficient and weak group strategyproof mechanisms that we call k-pivotal mechanisms and identify the complete subclass of these mechanisms that are feasible.

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.essex.ac.uk/economics/discussion-papers/papers-text/dp610.pdf
Download Restriction: no

Bibliographic Info

Paper provided by University of Essex, Department of Economics in its series Economics Discussion Papers with number 610.

as in new window
Length:
Date of creation: 19 Apr 2006
Date of revision:
Handle: RePEc:esx:essedp:610

Contact details of provider:
Postal: Wivenhoe Park, COLCHESTER. CO4 3SQ
Phone: +44-1206-872728
Fax: +44-1206-872724
Web page: http://www.essex.ac.uk/economics/
More information through EDIRC

Order Information:
Postal: Discussion Papers Administrator, Department of Economics, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, U.K.
Email:

Related research

Keywords:

Other versions of this item:

This paper has been announced in the following NEP Reports:

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, 2002. "Achieving the first best in sequencing problems," Review of Economic Design, Springer, vol. 7(1), pages 75-91.
  2. Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
  3. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
  4. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society.
  5. Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
  6. Shigehiro Serizawa, 2006. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," Social Choice and Welfare, Springer, vol. 26(2), pages 305-331, April.
  7. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
  8. Moulin, Herve & Bogomolnaia, Anna, 2001. "Random Matching under Dichotomous Preferences," Working Papers 2001-03, Rice University, Department of Economics.
  9. 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.
  10. Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
  11. Moulin, H., 1986. "Characterizations of the pivotal mechanism," Journal of Public Economics, Elsevier, vol. 31(1), pages 53-78, October.
  12. 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. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
  2. Conan Mukherjee, 2014. "Fair and group strategy-proof good allocation with money," Social Choice and Welfare, Springer, vol. 42(2), pages 289-311, February.
  3. 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).
  4. 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.
  5. 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.
  6. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
  7. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
  8. 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).
  9. 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.

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:esx:essedp:610. 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: (Essex Economics Web Manager).

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.