Finding robustly fair solutions in resource allocation
buir.advisor | Karsu, Özlem | |
dc.contributor.author | Elver, İzzet Egemen | |
dc.date.accessioned | 2022-08-10T07:15:21Z | |
dc.date.available | 2022-08-10T07:15:21Z | |
dc.date.copyright | 2022-07 | |
dc.date.issued | 2022-07 | |
dc.date.submitted | 2022-07 | |
dc.description | Cataloged from PDF version of article. | en_US |
dc.description | Includes bibliographical references (leaves 44-49). | en_US |
dc.description.abstract | In this study, we consider resource allocation problems 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 (measured by the total expected benefit) 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 the total expected benefit 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. | en_US |
dc.description.provenance | Submitted by Betül Özen (ozen@bilkent.edu.tr) on 2022-08-10T07:15:21Z No. of bitstreams: 2 B161103.pdf: 8450692 bytes, checksum: 87770bf07dd5b4d122eb2df459171007 (MD5) B161103.pdf: 8450692 bytes, checksum: 87770bf07dd5b4d122eb2df459171007 (MD5) | en |
dc.description.provenance | Made available in DSpace on 2022-08-10T07:15:21Z (GMT). No. of bitstreams: 2 B161103.pdf: 8450692 bytes, checksum: 87770bf07dd5b4d122eb2df459171007 (MD5) B161103.pdf: 8450692 bytes, checksum: 87770bf07dd5b4d122eb2df459171007 (MD5) Previous issue date: 2022-07 | en |
dc.description.statementofresponsibility | by İzzet Egemen Elver | en_US |
dc.embargo.release | 2023-01-26 | |
dc.format.extent | x, 67 leaves : illustrations (color), charts ; 30 cm. | en_US |
dc.identifier.itemid | B161103 | |
dc.identifier.uri | http://hdl.handle.net/11693/110408 | |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Fairness | en_US |
dc.subject | Equity | en_US |
dc.subject | Robust programming | en_US |
dc.subject | Knapsack problems | en_US |
dc.subject | Resource allocation | en_US |
dc.title | Finding robustly fair solutions in resource allocation | en_US |
dc.title.alternative | Kaynak paylaşımında gürbüz adil sonuçlar bulmak | en_US |
dc.type | Thesis | en_US |
thesis.degree.discipline | Industrial Engineering | |
thesis.degree.grantor | Bilkent University | |
thesis.degree.level | Master's | |
thesis.degree.name | MS (Master of Science) |