Please use this identifier to cite or link to this item: http://hdl.handle.net/10125/79521

Achieving MAX-MIN Fair Cross-efficiency scores in Data Envelopment Analysis

File Size Format  
0150.pdf 564.5 kB Adobe PDF View/Open

Item Summary

Title:Achieving MAX-MIN Fair Cross-efficiency scores in Data Envelopment Analysis
Authors:Radovanović, Sandro
Delibašić, Boris
Marković, Aleksandar
Suknović, Milija
Keywords:Fairness in Algorithmic Decision Making
algorithmic fairness
cross-efficiency
data envelopment analysis
Date Issued:04 Jan 2022
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.
Pages/Duration:9 pages
URI:http://hdl.handle.net/10125/79521
ISBN:978-0-9981331-5-7
DOI:10.24251/HICSS.2022.189
Rights:Attribution-NonCommercial-NoDerivatives 4.0 International
https://creativecommons.org/licenses/by-nc-nd/4.0/
Appears in Collections: Fairness in Algorithmic Decision Making


Please email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.

This item is licensed under a Creative Commons License Creative Commons