IDEAS home Printed from https://ideas.repec.org/a/the/publsh/1010.html
   My bibliography  Save this article

Two axiomatic approaches to the probabilistic serial mechanism

Author

Listed:
  • Hashimoto, Tadashi

    () (Institut d'\'{E}conomie Industrielle, Universit\'{e} Toulouse)

  • Hirata, Daisuke

    () (Department of Economics, Harvard University)

  • Kesten, Onur

    () (Tepper Business School, Carnegie Mellon University)

  • Kurino, Morimitsu

    () (Wissenschaftszentrum Berlin f\"ur Sozialforschung)

  • Ünver, M. Utku

    () (Department of Economics, Boston College)

Abstract

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns lotteries over objects. We show that it is the only mechanism satisfying non-wastefulness and ordinal fairness and the only mechanism satisfying sd-efficiency, sd-envy-freeness, and weak invariance or weak truncation robustness (where “sd” stands for first-order stochastic dominance).

Suggested Citation

  • Hashimoto, Tadashi & Hirata, Daisuke & Kesten, Onur & Kurino, Morimitsu & Ünver, M. Utku, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
  • Handle: RePEc:the:publsh:1010
    as

    Download full text from publisher

    File URL: http://econtheory.org/ojs/index.php/te/article/viewFile/20140253/10216/317
    Download Restriction: no

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. Stergios Athanassoglou & Jay Sethuraman, 2011. "House allocation with fractional endowments," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 481-513, August.
    3. Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
    4. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    5. Manea, Mihai, 2008. "A constructive proof of the ordinal efficiency welfare theorem," Journal of Economic Theory, Elsevier, vol. 141(1), pages 276-281, July.
    6. Kesten, Onur & Ünver, M. Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    7. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    8. Parag A. Pathak & Tayfun Sönmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.
    9. Pycia, Marek & Ünver, M. Utku, 2017. "Incentive compatible allocation and exchange of discrete resources," Theoretical Economics, Econometric Society, vol. 12(1), January.
    10. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    11. Aytek Erdil & Haluk Ergin, 2008. "What's the Matter with Tie-Breaking? Improving Efficiency in School Choice," American Economic Review, American Economic Association, vol. 98(3), pages 669-689, June.
    12. Pathak, Parag A. & Sethuraman, Jay, 2011. "Lotteries in student assignment: An equivalence result," Theoretical Economics, Econometric Society, vol. 6(1), January.
    13. Onur Kesten & Morimitsu Kurino & M. Utku Ünver, 2010. "Fair and Efficient Assignment via the Probabilistic Serial Mechanism," Boston College Working Papers in Economics 742, Boston College Department of Economics, revised 30 May 2011.
    14. Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
    15. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
    16. EHLERS, Lars & KLAUS, Bettina, 2009. "Allocation via Deferred-Acceptance under Responsive Priorities," Cahiers de recherche 2009-16, Universite de Montreal, Departement de sciences economiques.
    17. Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
    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. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2014. "Assigning agents to a line," Games and Economic Behavior, Elsevier, vol. 87(C), pages 539-553.
    2. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    3. Jörgen Kratz, 2017. "Overlapping multiple object assignments," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 723-753, March.
    4. Hugh-Jones, David & Kurino, Morimitsu & Vanberg, Christoph, 2014. "An experimental study on the incentives of the probabilistic serial mechanism," Games and Economic Behavior, Elsevier, vol. 87(C), pages 367-380.
    5. Christian Basteck, 2016. "Fair solutions to the random assignment problem," Working Papers 2016001, Berlin Doctoral Program in Economics and Management Science (BDPEMS).
    6. Kesten, Onur & Kurino, Morimitsu & Nesterov, Alexander, 2015. "Efficient lottery design," Discussion Papers, Research Unit: Market Behavior SP II 2015-203, Social Science Research Center Berlin (WZB).
    7. Alexander Nesterov, 2014. "Fairness and Efficiency in a Random Assignment: Three Impossibility Results," Working Papers 2014006, Berlin Doctoral Program in Economics and Management Science (BDPEMS).
    8. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    9. Mustafa Oǧuz Afacan, 2016. "Characterizations of the cumulative offer process," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 531-542, October.
    10. repec:eee:matsoc:v:90:y:2017:i:c:p:80-92 is not listed on IDEAS
    11. Heo, Eun Jeong, 2014. "Probabilistic assignment problem with multi-unit demands: A generalization of the serial rule and its characterization," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 40-47.
    12. repec:eee:jetheo:v:170:y:2017:i:c:p:145-168 is not listed on IDEAS
    13. repec:spr:sochwe:v:51:y:2018:i:1:d:10.1007_s00355-018-1110-z is not listed on IDEAS
    14. Bogomolnaia, Anna, 2015. "Random assignment: Redefining the serial rule," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 308-318.
    15. Cho, Wonki Jo, 2016. "Incentive properties for ordinal mechanisms," Games and Economic Behavior, Elsevier, vol. 95(C), pages 168-177.
    16. Cho, Wonki Jo, 2016. "When is the probabilistic serial assignment uniquely efficient and envy-free?," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 14-25.
    17. repec:spr:sochwe:v:49:y:2017:i:2:d:10.1007_s00355-017-1059-3 is not listed on IDEAS
    18. repec:eee:matsoc:v:90:y:2017:i:c:p:56-62 is not listed on IDEAS
    19. repec:eee:jetheo:v:175:y:2018:i:c:p:178-200 is not listed on IDEAS
    20. Anna Bogomolnaia, 2015. "The Most Ordinally-Efficient of Random Voting Rules," HSE Working papers WP BRP 106/EC/2015, National Research University Higher School of Economics.
    21. repec:eee:gamebe:v:105:y:2017:i:c:p:1-8 is not listed on IDEAS
    22. Alcalde, Jose & Silva-Reus, José Ángel, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, University of Alicante, D. Quantitative Methods and Economic Theory.
    23. Eun Heo, 2014. "The extended serial correspondence on a rich preference domain," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 439-454, May.

    More about this item

    Keywords

    Random assignment; probabilistic serial; ordinal fairness; sd-efficiency; sd-envy-freeness;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    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:the:publsh:1010. 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: (Martin J. Osborne). General contact details of provider: http://econtheory.org .

    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.