Fair allocation of indivisible goods with minimum inequality or minimum envy

Dries Cornilly; Giovanni Puccetti; Ludger Rüschendorf; Steven Vanduffel

doi:10.1016/j.ejor.2021.06.020

Fair allocation of indivisible goods with minimum inequality or minimum envy

Dries Cornilly, Giovanni Puccetti, Ludger Rüschendorf, Steven Vanduffel

Business

Onderzoeksoutput: Article › peer review

4 Citaten (Scopus)

117 Downloads (Pure)

Samenvatting

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.

Originele taal-2	English
Pagina's (van-tot)	741-752
Aantal pagina's	12
Tijdschrift	European Journal of Operational Research
Volume	297
Nummer van het tijdschrift	2
DOI's	https://doi.org/10.1016/j.ejor.2021.06.020
Status	Published - 1 mrt 2022

Bibliografische nota

Funding Information:
We thank three anonymous reviewers for their very helpful suggestions on a previous version of this paper.

Publisher Copyright:
© 2021 Elsevier B.V.

Copyright:
Copyright 2022 Elsevier B.V., All rights reserved.

Toegang tot document

10.1016/j.ejor.2021.06.020

Fair allocation of indivisible goods with minimum inequality or minimum envyAccepted author manuscript, 532 KBLicentie: CC BY-NC-ND

Andere bestanden en links

Link naar publicatie in Scopus

FWOSBO36: SBO project : Naar efficiënte pijler II en III pensioenbeslissingen in België: Productinnovaties, doelstelling-gerichte pensioenplannen op maat en nudging
Vanduffel, S., Bernard, C. & Schreurs, B.
1/10/20 → 30/09/24
Project: Toegepast

Citeer dit

@article{b37d0bef73b14d72af49f12be0ce1870,

title = "Fair allocation of indivisible goods with minimum inequality or minimum envy",

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.",

author = "Dries Cornilly and Giovanni Puccetti and Ludger R{\"u}schendorf and Steven Vanduffel",

note = "Funding Information: We thank three anonymous reviewers for their very helpful suggestions on a previous version of this paper. Publisher Copyright: {\textcopyright} 2021 Elsevier B.V. Copyright: Copyright 2022 Elsevier B.V., All rights reserved.",

year = "2022",

month = mar,

day = "1",

doi = "10.1016/j.ejor.2021.06.020",

language = "English",

volume = "297",

pages = "741--752",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Fair allocation of indivisible goods with minimum inequality or minimum envy

AU - Cornilly, Dries

AU - Puccetti, Giovanni

AU - Rüschendorf, Ludger

AU - Vanduffel, Steven

N1 - Funding Information: We thank three anonymous reviewers for their very helpful suggestions on a previous version of this paper. Publisher Copyright: © 2021 Elsevier B.V. Copyright: Copyright 2022 Elsevier B.V., All rights reserved.

PY - 2022/3/1

Y1 - 2022/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85111043290&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2021.06.020

DO - 10.1016/j.ejor.2021.06.020

M3 - Article

VL - 297

SP - 741

EP - 752

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -

Fair allocation of indivisible goods with minimum inequality or minimum envy

Samenvatting

Bibliografische nota

Toegang tot document

Andere bestanden en links

Vingerafdruk

Projecten

FWOSBO36: SBO project : Naar efficiënte pijler II en III pensioenbeslissingen in België: Productinnovaties, doelstelling-gerichte pensioenplannen op maat en nudging

Citeer dit