Fair allocation of indivisible goods with minimum inequality or minimum envy

Dries Cornilly, Giovanni Puccetti, Ludger Rüschendorf and Steven Vanduffel ()

European Journal of Operational Research, 2022, vol. 297, issue 2, 741-752

Abstract: We provide a new mathematical framework for the classic problem of fair allocation of indivisible goods, showing that it can be formulated as the problem of finding an optimal column rearrangement of multiple matrices. Based on this formulation, we design two novel algorithms called MinCov and MinCovTarget to find optimal allocations under the newly introduced notion of minimum social inequality, and the popular notion of minimum envy. Numerical illustrations show an excellent performance of the newly developed algorithms also with respect to other allocation criteria, in particular for the maximum Nash welfare.

Keywords: Decision analysis; Algorithms for fair allocation; Perfect social equality; Minimum envy; Maximum Nash welfare; Pareto optimality (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722172100535X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:297:y:2022:i:2:p:741-752

DOI: 10.1016/j.ejor.2021.06.020

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().