IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v104y2020icp78-87.html
   My bibliography  Save this article

Short trading cycles: Paired kidney exchange with strict ordinal preferences

Author

Listed:
  • Balbuzanov, Ivan

Abstract

I study kidney exchange with strict ordinal preferences and with constraints on the lengths of the exchange cycles. Efficient deterministic mechanisms have poor fairness properties in this environment. Instead, I propose an individually rational, ordinally efficient and anonymous random mechanism for two-way kidney exchange based on Bogomolnaia and Moulin’s (2001) Probabilistic Serial mechanism. Individual rationality incentivizes patient–donor pairs who are compatible with each other to participate in the exchange, thus increasing the overall transplantation rate. Finally, individual rationality, ex-post efficiency and weak strategyproofness are incompatible for any mechanism.

Suggested Citation

  • Balbuzanov, Ivan, 2020. "Short trading cycles: Paired kidney exchange with strict ordinal preferences," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 78-87.
    • Handle: RePEc:eee:matsoc:v:104:y:2020:i:c:p:78-87
    DOI: 10.1016/j.mathsocsci.2019.08.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489619300654
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2019.08.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    2. , & , E., 2014. "Free riding and participation in large scale, multi-hospital kidney exchange," Theoretical Economics, Econometric Society, vol. 9(3), September.
    3. Roth, Alvin E. & Sonmez, Tayfun & Unver, Utku & Delmonico, Francis & Saidman, Susan L., 2014. "Utilizing List Exchange and Non-directed Donation through “Chain” Paired Kidney Donations," MPRA Paper 58246, University Library of Munich, Germany.
    4. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    5. Kesten, Onur & Kurino, Morimitsu & Ünver, M. Utku, 2017. "On characterizations of the probabilistic serial mechanism involving incentive and invariance properties," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 56-62.
    6. Alvin E. Roth & Tayfun Sönmez, 2005. "A Kidney Exchange Clearinghouse in New England," American Economic Review, American Economic Association, vol. 95(2), pages 376-380, May.
    7. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    8. Chang, Hee-In & Chun, Youngsub, 2017. "Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 80-92.
    9. Andersson, Tommy & Kratz, Jörgen, 2016. "Kidney Exchange over the Blood Group Barrier," Working Papers 2016:11, Lund University, Department of Economics, revised 29 Nov 2017.
    10. Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
    11. Sönmez, Tayfun & Ünver, M. Utku, 2014. "Altruistically unbalanced kidney exchange," Journal of Economic Theory, Elsevier, vol. 152(C), pages 105-129.
    12. Vulkan, Nir & Roth, Alvin E. & Neeman, Zvika (ed.), 2013. "The Handbook of Market Design," OUP Catalogue, Oxford University Press, number 9780199570515.
    13. Tayfun Sönmez & M. Utku Ünver & M. Bumin Yenmez, 2020. "Incentivized Kidney Exchange," American Economic Review, American Economic Association, vol. 110(7), pages 2198-2224, July.
    14. 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.
    15. YIlmaz, Özgür, 2011. "Kidney exchange: An egalitarian mechanism," Journal of Economic Theory, Elsevier, vol. 146(2), pages 592-618, March.
    16. Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
    17. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    18. Bogomolnaia, Anna & Heo, Eun Jeong, 2012. "Probabilistic assignment of objects: Characterizing the serial rule," Journal of Economic Theory, Elsevier, vol. 147(5), pages 2072-2082.
    19. 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.
    20. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    21. Saidman, Susan L. & Roth, Alvin E. & Sonmez, Tayfun & Unver, M. Utku & Delmonico, Francis L., 2014. "Increasing the Opportunity of Live Kidney Donation by Matching for Two and Three Way Exchanges," MPRA Paper 58247, University Library of Munich, Germany.
    22. YIlmaz, Özgür, 2009. "Random assignment under weak preferences," Games and Economic Behavior, Elsevier, vol. 66(1), pages 546-558, May.
    23. Hashimoto, Tadashi & Hirata, Daisuke & Kesten, Onur & Kurino, Morimitsu & Unver, Utku, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
    24. Okumura, Yasunori, 2014. "Priority matchings revisited," Games and Economic Behavior, Elsevier, vol. 88(C), pages 242-249.
    25. Tayfun Sönmez & M Utku Ünver, 2017. "Market design for living-donor organ exchanges: an economic policy perspective," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 676-704.
    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. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).

    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. Tayfun Sönmez & M Utku Ünver, 2017. "Market design for living-donor organ exchanges: an economic policy perspective," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 676-704.
    2. Sönmez, Tayfun & Ünver, M. Utku & Yılmaz, Özgür, 2018. "How (not) to integrate blood subtyping technology to kidney exchange," Journal of Economic Theory, Elsevier, vol. 176(C), pages 193-231.
    3. Nicolò, Antonio & Rodríguez-Álvarez, Carmelo, 2017. "Age-based preferences in paired kidney exchange," Games and Economic Behavior, Elsevier, vol. 102(C), pages 508-524.
    4. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    5. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
    6. Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
    7. Jorgen Kratz, 2019. "Triage in Kidney Exchange," Discussion Papers 19/04, Department of Economics, University of York.
    8. Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
    9. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    10. 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.
    11. Andersson, Tommy & Kratz, Jörgen, 2016. "Kidney Exchange over the Blood Group Barrier," Working Papers 2016:11, Lund University, Department of Economics, revised 29 Nov 2017.
    12. 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.
    13. Ross Anderson & Itai Ashlagi & David Gamarnik & Michael Rees & Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2015. "Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted," Interfaces, INFORMS, vol. 45(1), pages 26-42, February.
    14. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
    15. 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.
    16. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    17. Chang, Hee-In & Chun, Youngsub, 2017. "Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 80-92.
    18. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    19. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.
    20. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.

    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:matsoc:v:104:y:2020:i:c:p:78-87. 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/inca/505565 .

    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.