IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v131y2025ics0305048324001725.html
   My bibliography  Save this article

Finding robustly fair solutions in resource allocation

Author

Listed:
  • Karsu, Özlem
  • Elver, İzzet Egemen
  • Kınık, Tuna Arda

Abstract

In this study, we consider resource allocation settings where the decisions affect multiple beneficiaries and the decision maker aims to ensure that the effect is distributed to the beneficiaries in an equitable manner. We specifically consider stochastic environments where there is uncertainty in the system and propose a robust programming approach that aims at maximizing system efficiency while guaranteeing an equitable benefit allocation even under the worst scenario. Acknowledging the fact that the robust solution may lead to high efficiency loss and may be over-conservative, we adopt a parametric approach that allows controlling the level of conservatism and present the decision maker alternative solutions that reveal the trade-off between efficiency and the degree of conservatism when incorporating fairness. We obtain tractable formulations, leveraging the results we provide on the properties of highly unfair allocations. We demonstrate the usability of our approach on project selection and shelter allocation applications.

Suggested Citation

  • Karsu, Özlem & Elver, İzzet Egemen & Kınık, Tuna Arda, 2025. "Finding robustly fair solutions in resource allocation," Omega, Elsevier, vol. 131(C).
  • Handle: RePEc:eee:jomega:v:131:y:2025:i:c:s0305048324001725
    DOI: 10.1016/j.omega.2024.103208
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324001725
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.omega.2024.103208?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.

    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:jomega:v:131:y:2025:i:c:s0305048324001725. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.