Finding robustly fair solutions in resource allocation
buir.contributor.author | Karsu, Ozlem | |
buir.contributor.author | Elver, Izzet Egemen | |
buir.contributor.author | Kinik, Tuna Arda | |
buir.contributor.orcid | Karsu, Ozlem|0000-0002-9926-2021 | |
dc.citation.epage | 14 | |
dc.citation.spage | 1 | |
dc.citation.volumeNumber | 131 | |
dc.contributor.author | Karsu, Ozlem | |
dc.contributor.author | Elver, Izzet Egemen | |
dc.contributor.author | Kinik, Tuna Arda | |
dc.date.accessioned | 2025-02-18T18:10:27Z | |
dc.date.available | 2025-02-18T18:10:27Z | |
dc.date.issued | 2025-02 | |
dc.department | Department of Industrial Engineering | |
dc.description.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. | |
dc.description.provenance | Submitted by Mutluhan Gürel (mutluhan.gurel@bilkent.edu.tr) on 2025-02-18T18:10:27Z No. of bitstreams: 1 Finding_robustly_fair_solutions_in_resource_allocation.pdf: 880372 bytes, checksum: 32984f626dee3c5ee98100a269f182c3 (MD5) | en |
dc.description.provenance | Made available in DSpace on 2025-02-18T18:10:27Z (GMT). No. of bitstreams: 1 Finding_robustly_fair_solutions_in_resource_allocation.pdf: 880372 bytes, checksum: 32984f626dee3c5ee98100a269f182c3 (MD5) Previous issue date: 2025-02 | en |
dc.embargo.release | 2027-02-28 | |
dc.identifier.doi | 10.1016/j.omega.2024.103208 | |
dc.identifier.eisbn | 1873-5274 | |
dc.identifier.issn | 0305-0483 | |
dc.identifier.uri | https://hdl.handle.net/11693/116393 | |
dc.language.iso | English | |
dc.publisher | Elsevier Ltd | |
dc.relation.isversionof | https://doi.org/10.1016/j.omega.2024.103208 | |
dc.rights | CC BY-NC-ND 4.0 (Attribution-NonCommercial-NoDerivatives 4.0 International Deed) | |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.source.title | Omega | |
dc.subject | Fairness | |
dc.subject | Equity | |
dc.subject | Robust programming | |
dc.subject | Knapsack problems | |
dc.subject | Resource allocation | |
dc.title | Finding robustly fair solutions in resource allocation | |
dc.type | Article |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Finding_robustly_fair_solutions_in_resource_allocation.pdf
- Size:
- 859.74 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: