IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v165y2005i1p251-266.html
   My bibliography  Save this article

Incomplete information and multiple machine queueing problems

Author

Listed:
  • Mitra, Manipushpak

Abstract

In mechanism design problems under incomplete information, it is generally difficult to find decision problems that are first best implementable. A decision problem under incomplete information is first best implementable if there exists a mechanism that extracts the private information and achieves efficiency with a transfer scheme that adds up to zero in every state. One such problem is the queueing problem with one machine. In this paper we identify the conditions on cost structure for which queueing problems with multiple machines are first best implementable.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
    • Handle: RePEc:eee:ejores:v:165:y:2005:i:1:p:251-266
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00085-2
    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 below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
    2. Walker, Mark, 1980. "On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions," Econometrica, Econometric Society, vol. 48(6), pages 1521-1540, September.
    3. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.
    4. 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.
    5. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-1144, September.
    6. Richard A. Dudek & Ottis Foy Teuton, 1964. "Development of M -Stage Decision Rule for Scheduling N Jobs Through M Machines," Operations Research, INFORMS, vol. 12(3), pages 471-497, June.
    7. 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.
    8. van den Nouweland, Anne & Krabbenborg, Marc & Potters, Jos, 1992. "Flow-shops with a dominant machine," European Journal of Operational Research, Elsevier, vol. 62(1), pages 38-46, October.
    9. Groves, Theodore & Loeb, Martin, 1975. "Incentives and public inputs," Journal of Public Economics, Elsevier, vol. 4(3), pages 211-226, August.
    10. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    11. Liqun Liu & Guoqiang Tian, 1999. "A characterization of the existenceof optimal dominant strategy mechanisms," Review of Economic Design, Springer;Society for Economic Design, vol. 4(3), pages 205-218.
    12. Hurwicz, Leonid & Walker, Mark, 1990. "On the Generic Nonoptimality of Dominant-Strategy Allocation Mechanisms: A General Theorem That Includes Pure Exchange Economies," Econometrica, Econometric Society, vol. 58(3), pages 683-704, May.
    13. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    14. Tian, Guoqiang, 1996. "On the existence of optimal truth-dominant mechanisms," Economics Letters, Elsevier, vol. 53(1), pages 17-24, October.
    15. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    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 & Mutuswami, Suresh, 2011. "Group strategyproofness in queueing models," Games and Economic Behavior, Elsevier, vol. 72(1), pages 242-254, May.
    2. Dominik Kress & Sebastian Meiswinkel & Erwin Pesch, 2018. "Mechanism design for machine scheduling problems: classification and literature overview," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 583-611, July.
    3. 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.
    4. Leticia Lorenzo, 2019. "Comments on: recent developments in the queueing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 28-30, April.
    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.
    6. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2019. "Recent developments in the queueing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 1-23, April.
    7. Slikker, Marco, 2006. "Balancedness of multiple machine sequencing games revisited," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1944-1949, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tian, Guoqiang, 1997. "Virtual implementation in incomplete information environments with infinite alternatives and types," Journal of Mathematical Economics, Elsevier, vol. 28(3), pages 313-339, October.
    2. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
    3. Hain, Roland & Mitra, Manipushpak, 2004. "Simple sequencing problems with interdependent costs," Games and Economic Behavior, Elsevier, vol. 48(2), pages 271-291, August.
    4. 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.
    5. 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.
    6. Yi, Jianxin & Li, Yong, 2016. "A general impossibility theorem and its application to individual rights," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 79-86.
    7. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
    8. 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.
    9. Kazuhiko Hashimoto & Hiroki Saitoh, 2010. "Domain expansion of the pivotal mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 34(3), pages 455-470, March.
    10. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.
    11. Makowski, Louis & Ostroy, Joseph M. & Segal, Uzi, 1999. "Efficient Incentive Compatible Economies Are Perfectly Competitive," Journal of Economic Theory, Elsevier, vol. 85(2), pages 169-225, April.
    12. Parikshit De & Manipushpak Mitra, 2017. "Incentives and justice for sequencing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(2), pages 239-264, August.
    13. Luis Corchón & José Rueda-Llano, 2008. "Differentiable strategy-proof mechanisms for private and public goods in domains that are not necessarily large or quasi-linear," Review of Economic Design, Springer;Society for Economic Design, vol. 12(4), pages 279-291, December.
    14. 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.
    15. Monique Florenzano, 2009. "From equilibrium models to mechanism design: On the place and the role of government in the public goods provision analysis in the second part of the twentieth century," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00367859, HAL.
    16. Monique Florenzano, 2010. "Government and the provision of public goods:from equilibrium models to mechanismdesign," The European Journal of the History of Economic Thought, Taylor & Francis Journals, vol. 17(4), pages 1047-1077.
    17. Pedro Calleja & Peter Borm & Herbert Hamers & Flip Klijn & Marco Slikker, 2002. "On a New Class of Parallel Sequencing Situations and Related Games," Annals of Operations Research, Springer, vol. 109(1), pages 265-277, January.
    18. van Velzen, S., 2003. "Sequencing Games with Controllable Processing Time," Discussion Paper 2003-105, Tilburg University, Center for Economic Research.
    19. Healy, Paul J. & Jain, Ritesh, 2017. "Generalized Groves–Ledyard mechanisms," Games and Economic Behavior, Elsevier, vol. 101(C), pages 204-217.
    20. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.

    More about this item

    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:eee:ejores:v:165:y:2005:i:1:p:251-266. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.