IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v17y2001i2p277-305.html
   My bibliography  Save this article

Mechanism design in queueing problems

Author

Listed:
  • Manipushpak Mitra

    () (Indian Statistical Institute, 7, S. J. S. S. Marg, New Delhi-110016, INDIA .)

Abstract

A well-known result in incentive theory is that for a very broad class of decision problems, there is no mechanism which achieves truth-telling in dominant strategies, efficiency and budget balancedness (or first best implementability). On the contrary, Mitra and Sen (1998), prove that linear cost queueing problems are first best implementable. This paper is an attempt at identification of cost structures for which queueing problems are first best implementable. The broad conclusion is that, this is a fairly large class. Some of these first best implementable problems can be implemented by mechanisms that satisfy individual rationality.

Suggested Citation

  • Manipushpak Mitra, 2001. "Mechanism design in queueing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 17(2), pages 277-305.
  • Handle: RePEc:spr:joecth:v:17:y:2001:i:2:p:277-305
    Note: Received: October 19, 1999; revised version: March 13, 2000.
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00199/papers/1017002/10170277.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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-438, March.
    2. Jeroen Suijs, 1996. "On incentive compatibility and budget balancedness in public decision making," Review of Economic Design, Springer;Society for Economic Design, vol. 2(1), pages 193-209, December.
    3. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-1144, September.
    4. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    5. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    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


    Cited by:

    1. Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
    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;Game Theory Society, vol. 42(1), pages 131-163, February.
    3. Manipushpak Mitra & Arunava Sen, 2010. "Efficient allocation of heterogenous commodities with balanced transfers," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(1), pages 29-48, June.
    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. 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).
    6. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    7. Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 151-162, September.
    8. Moulin, Hervé, 2010. "An efficient and almost budget balanced cost sharing method," Games and Economic Behavior, Elsevier, vol. 70(1), pages 107-131, September.
    9. Hervé Moulin, 2007. "On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 266-283, May.
    10. Stefano Galavotti & Nozomu Muto & Daisuke Oyama, 2011. "On efficient partnership dissolution under ex post individual rationality," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 87-123, September.
    11. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
    12. 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).
    13. repec:spr:sochwe:v:49:y:2017:i:1:d:10.1007_s00355-017-1051-y is not listed on IDEAS
    14. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2017. "Reordering an existing queue," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(1), pages 65-87, June.
    15. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
    16. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
    17. Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics.
    18. Heydenreich Birgit & Mishra Debasis & Müller Rudolf & Uetz Marc, 2008. "Optimal Mechanisms for Single Machine Scheduling," Research Memorandum 033, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    19. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2014. "Egalitarian equivalence and strategyproofness in the queueing problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 425-442, June.
    20. De, Parikshit, 2014. "Rawlsian Allocation In Queueing And Sequencing Problem," MPRA Paper 58744, University Library of Munich, Germany.
    21. Youngsub Chun, 2011. "Consistency and monotonicity in sequencing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 29-41, February.
    22. René Brink & Youngsub Chun, 2012. "Balanced consistency and balanced cost reduction for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 519-529, March.
    23. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.

    More about this item

    Keywords

    Dominant strategy incentive compatibility; Efficiency; Budget balancedness; Individual rationality.;

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:17:y:2001:i:2:p:277-305. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.