IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v143y2024icp25-50.html
   My bibliography  Save this article

Rejection-proof mechanisms for multi-agent kidney exchange

Author

Listed:
  • Blom, Danny
  • Smeulders, Bart
  • Spieksma, Frits

Abstract

Kidney exchange programs (KEPs) increase kidney transplantation by facilitating the exchange of incompatible donors. Increasing the scale of KEPs leads to more opportunities for transplants. Collaboration between transplant organizations (agents) is thus desirable. As agents are primarily interested in providing transplants for their own patients, collaboration requires balancing individual and common objectives. In this paper, we consider ex-post strategic behavior, where agents can modify a proposed set of kidney exchanges. We introduce the class of rejection-proof mechanisms, which propose a set of exchanges such that agents have no incentive to reject them. We provide an exact mechanism and establish that the underlying optimization problem is Σ2P-hard; we also describe computationally less demanding heuristic mechanisms. We show rejection-proofness can be achieved at a limited cost for typical instances. Furthermore, our experiments show that the proposed rejection-proof mechanisms also remove incentives for strategic behavior in the ex-ante setting, where agents withhold information.

Suggested Citation

  • Blom, Danny & Smeulders, Bart & Spieksma, Frits, 2024. "Rejection-proof mechanisms for multi-agent kidney exchange," Games and Economic Behavior, Elsevier, vol. 143(C), pages 25-50.
    • Handle: RePEc:eee:gamebe:v:143:y:2024:i:c:p:25-50
    DOI: 10.1016/j.geb.2023.10.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825623001653
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2023.10.015?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. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    2. Gerhard J. Woeginger, 2021. "The trouble with the second quantifier," 4OR, Springer, vol. 19(2), pages 157-181, June.
    3. Wayne F. Bialas & Mark H. Karwan, 1984. "Two-Level Linear Programming," Management Science, INFORMS, vol. 30(8), pages 1004-1020, August.
    4. Ashlagi, Itai & Fischer, Felix & Kash, Ian A. & Procaccia, Ariel D., 2015. "Mix and match: A strategyproof mechanism for multi-hospital kidney exchange," Games and Economic Behavior, Elsevier, vol. 91(C), pages 284-296.
    5. , & , E., 2014. "Free riding and participation in large scale, multi-hospital kidney exchange," Theoretical Economics, Econometric Society, vol. 9(3), September.
    6. Leonardo Lozano & J. Cole Smith, 2017. "A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem," Operations Research, INFORMS, vol. 65(3), pages 768-786, June.
    7. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    8. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    9. Radu-Stefan Mincu & Péter Biró & Márton Gyetvai & Alexandru Popa & Utkarsh Verma, 2021. "IP solutions for international kidney exchange programmes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 403-423, June.
    10. James T. Moore & Jonathan F. Bard, 1990. "The Mixed Integer Linear Bilevel Programming Problem," Operations Research, INFORMS, vol. 38(5), pages 911-921, October.
    11. Carvalho, Margarida & Lodi, Andrea & Pedroso, João.P., 2022. "Computing equilibria for integer programming games," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1057-1070.
    Full references (including those not matched with items on IDEAS)

    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. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    2. 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.
    3. Junlong Zhang & Osman Y. Özaltın, 2021. "Bilevel Integer Programs with Stochastic Right-Hand Sides," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1644-1660, October.
    4. Martelli, Emanuele & Freschini, Marco & Zatti, Matteo, 2020. "Optimization of renewable energy subsidy and carbon tax for multi energy systems using bilevel programming," Applied Energy, Elsevier, vol. 267(C).
    5. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2019. "Interdiction Games and Monotonicity, with Application to Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 390-410, April.
    6. S A Gabriel & Y Shim & A J Conejo & S de la Torre & R García-Bertrand, 2010. "A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1404-1419, September.
    7. Wen, U. P. & Huang, A. D., 1996. "A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 563-571, February.
    8. 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.
    9. John P. Dickerson & Ariel D. Procaccia & Tuomas Sandholm, 2019. "Failure-Aware Kidney Exchange," Management Science, INFORMS, vol. 65(4), pages 1768-1791, April.
    10. Liu, Shaonan & Kong, Nan & Parikh, Pratik & Wang, Mingzheng, 2023. "Optimal trauma care network redesign with government subsidy: A bilevel integer programming approach," Omega, Elsevier, vol. 119(C).
    11. Gabriel, Steven A. & Leuthold, Florian U., 2010. "Solving discretely-constrained MPEC problems with applications in electric power markets," Energy Economics, Elsevier, vol. 32(1), pages 3-14, January.
    12. Itai Ashlagi & Maximilien Burq & Patrick Jaillet & Vahideh Manshadi, 2019. "On Matching and Thickness in Heterogeneous Dynamic Markets," Operations Research, INFORMS, vol. 67(4), pages 927-949, July.
    13. 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.
    14. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    15. George Kozanidis & Eftychia Kostarelou, 2023. "An Exact Solution Algorithm for Integer Bilevel Programming with Application in Energy Market Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 573-607, May.
    16. Böttger, T. & Grimm, V. & Kleinert, T. & Schmidt, M., 2022. "The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1095-1111.
    17. Tom Demeulemeester & Dries Goossens & Ben Hermans & Roel Leus, 2023. "Fair integer programming under dichotomous and cardinal preferences," Papers 2306.13383, arXiv.org, revised Apr 2024.
    18. 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.
    19. Tanınmış, Kübra & Aras, Necati & Altınel, İ. Kuban, 2022. "Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 40-52.
    20. Soares, Inês & Alves, Maria João & Henggeler Antunes, Carlos, 2021. "A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 52-66.

    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:gamebe:v:143:y:2024:i:c:p:25-50. 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/622836 .

    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.