IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i12p1131-1142.html
   My bibliography  Save this article

Proportionally fair organ transplantation allocation rules

Author

Listed:
  • Farhad Hasankhani
  • Amin Khademi

Abstract

We introduce a new fairness measure for designing organ allocation rules for transplantation. In particular, we apply the proportional fairness measure for organ transplantation whose solution can be interpreted as the solution to the Nash bargaining problem for sharing limited donor organs among patients who seek to maximize their Quality-Adjusted Life-Years (QALYs). The motivation arises from several observations that current measures of fairness induce significant inefficiencies in terms of total QALYs of the patient population. We use the asymptotic results for the fluid approximation of a transplant queuing system to estimate the expected utility of patients and formulate an optimization problem where the decision maker partitions the set of organ types to achieve a proportionally fair objective. We use an achievable region approach to transform our formulation to an alternative optimization problem and show that the optimal allocation policy under the proportional fairness measure is assortative, which has the following insight: higher quality organs are allocated to patients who will have higher expected QALYs. We compare the performance of allocation rules developed for fairness purposes in organ allocation along with our proposed policy via a validated simulation model for heart transplantation in the US.

Suggested Citation

  • Farhad Hasankhani & Amin Khademi, 2022. "Proportionally fair organ transplantation allocation rules," IISE Transactions, Taylor & Francis Journals, vol. 54(12), pages 1131-1142, September.
  • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:12:p:1131-1142
    DOI: 10.1080/24725854.2022.2030074
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2022.2030074
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2022.2030074?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.

    More about this item

    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:taf:uiiexx:v:54:y:2022:i:12:p:1131-1142. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.