IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/58744.html
   My bibliography  Save this paper

Rawlsian Allocation In Queueing And Sequencing Problem

Author

Listed:
  • De, Parikshit

Abstract

In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian allocation rule on queueing and sequencing problems. We find that in case of queueing problems, Efficient allocation rules are Rawlsian but the converse is not true. For a particular class of Rawlsian allocation rule we characterize the unique class of transfer rule that ensures non-manipulability. Also in case of a situation where there is private information in multiple dimension, we find that a the particular kind of Rawlsian allocation rule equipped with a suitable transfer rule works as a panacea.

Suggested Citation

  • De, Parikshit, 2014. "Rawlsian Allocation In Queueing And Sequencing Problem," MPRA Paper 58744, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:58744
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/58744/1/MPRA_paper_58744.pdf
    File Function: original version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/65444/1/MPRA_paper_58744.pdf
    File Function: revised version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
    2. Shigehiro Serizawa, 2006. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(2), pages 305-331, April.
    3. 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.
    4. 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.
    5. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    6. Manipushpak Mitra, 2002. "Achieving the first best in sequencing problems," Review of Economic Design, Springer;Society for Economic Design, vol. 7(1), pages 75-91.
    7. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    8. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
    9. Mitra, Manipushpak & Mutuswami, Suresh, 2011. "Group strategyproofness in queueing models," Games and Economic Behavior, Elsevier, vol. 72(1), pages 242-254, May.
    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. Aloysius Ajab AMIN, 2015. "An incentive compatible model for eliciting firms’ production function in a development process," Journal of Economics Library, KSP Journals, vol. 2(2), pages 93-101, June.

    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. 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;Game Theory Society, vol. 42(1), pages 131-163, February.
    3. 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.
    4. Mitra, Manipushpak & Mutuswami, Suresh, 2011. "Group strategyproofness in queueing models," Games and Economic Behavior, Elsevier, vol. 72(1), pages 242-254, May.
    5. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2023. "Balanced VCG mechanisms for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 35-46, January.
    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. 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.
    8. Banerjee, Sreoshi & De, Parikshit & Mitra, Manipushpak, 2020. "A welfarist approach to sequencing problems with incentives," MPRA Paper 107188, University Library of Munich, Germany.
    9. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
    10. 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.
    11. 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.
    12. Yengin, Duygu & Chun, Youngsub, 2020. "No-envy, solidarity, and strategy-proofness in the queueing problem," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 87-97.
    13. Chun, Youngsub & Yengin, Duygu, 2017. "Welfare lower bounds and strategy-proofness in the queueing problem," Games and Economic Behavior, Elsevier, vol. 102(C), pages 462-476.
    14. 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.
    15. 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.
    16. 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.
    17. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2014. "Characterizations of pivotal mechanisms in the queueing problem," Mathematical Social Sciences, Elsevier, vol. 72(C), pages 62-66.
    18. KayI, Çagatay & Ramaekers, Eve, 2010. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," Games and Economic Behavior, Elsevier, vol. 68(1), pages 220-232, January.
    19. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
    20. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.

    More about this item

    Keywords

    Queueing problems; Sequencing problems; Strategyproofness; Rawlsian allocation.;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:pra:mprapa:58744. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.