Please use this identifier to cite or link to this item:
https://rfos.fon.bg.ac.rs/handle/123456789/2416Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Radovanović, Sandro | |
| dc.creator | Delibašić, Boris | |
| dc.creator | Marković, Aleksandar | |
| dc.creator | Suknović, Milija | |
| dc.date.accessioned | 2023-05-12T11:46:15Z | - |
| dc.date.available | 2023-05-12T11:46:15Z | - |
| dc.date.issued | 2022 | |
| dc.identifier.issn | 1530-1605 | |
| dc.identifier.uri | https://rfos.fon.bg.ac.rs/handle/123456789/2416 | - |
| dc.description.abstract | Algorithmic decision making is gaining popularity in today's business. The need for fast, accurate, and complex decisions forces decision-makers to take advantage of algorithms. However, algorithms can create unwanted bias or undesired consequences that can be averted. In this paper, we propose a MAX-MIN fair cross-efficiency data envelopment analysis (DEA) model that solves the problem of high variance cross-efficiency scores. The MAX-MIN cross-efficiency procedure is in accordance with John Rawls's Theory of justice by allowing efficiency and cross-efficiency estimation such that the greatest benefit of the least-advantaged decision making unit is achieved. The proposed mathematical model is tested on a healthcare related dataset. The results suggest that the proposed method solves several issues of cross-efficiency scores. First, it enables full rankings by having the ability to discriminate between the efficiency scores of DMUs. Second, the variance of cross-efficiency scores is reduced, and finally, fairness is introduced through optimization of the minimal efficiency scores. | en |
| dc.publisher | IEEE Computer Society | |
| dc.relation | This work was supported in part by the ONR/ONR Global under Grant N62909-19-1-2008. | |
| dc.rights | restrictedAccess | |
| dc.source | Proceedings of the Annual Hawaii International Conference on System Sciences | |
| dc.title | Achieving MAX-MIN Fair Cross-efficiency scores in Data Envelopment Analysis | en |
| dc.type | conferenceObject | |
| dc.rights.license | ARR | |
| dc.citation.epage | 1530 | |
| dc.citation.other | 2022-January: 1522-1530 | |
| dc.citation.spage | 1522 | |
| dc.citation.volume | 2022-January | |
| dc.identifier.rcub | conv_3792 | |
| dc.identifier.scopus | 2-s2.0-85152241659 | |
| dc.type.version | publishedVersion | |
| item.cerifentitytype | Publications | - |
| item.fulltext | No Fulltext | - |
| item.grantfulltext | none | - |
| item.openairetype | conferenceObject | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| Appears in Collections: | Radovi istraživača / Researchers’ publications | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.