Multivariate algorithmics for eliminating envy by donating goods

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00378602" target="_blank" >RIV/68407700:21240/24:00378602 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/s10458-024-09674-5" target="_blank" >https://doi.org/10.1007/s10458-024-09674-5</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10458-024-09674-5" target="_blank" >10.1007/s10458-024-09674-5</a>

Result language

angličtina

Original language name

Multivariate algorithmics for eliminating envy by donating goods

Original language description

Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of agents might change and envy might arise. We study the following problem to cope with such situations: given an allocation of indivisible resources to agents with additive utility-based preferences, is it possible to socially donate some of the resources (which means removing these resources from the allocation instance) such that the resulting modified allocation is envy-free (up to one good). We require that the number of deleted resources and/or the caused utilitarian welfare loss of the allocation are bounded. We conduct a thorough study of the (parameterized) computational complexity of this problem considering various natural and problem-specific parameters (e.g., the number of agents, the number of deleted resources, or the maximum number of resources assigned to an agent in the initial allocation) and different preference models, including unary-encoded and 0/1-valuations. In our studies, we obtain a rich set of (parameterized) tractability and intractability results and discover several surprising contrasts, for instance, between the two closely related fairness concepts envy-freeness and envy-freeness up to one good and between the influence of the parameters maximum number and welfare of the deleted resources.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Autonomous Agents and Multi-Agent Systems

ISSN

1387-2532

e-ISSN

1573-7454

Volume of the periodical

38

Issue of the periodical within the volume

2

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

35

Pages from-to

—

UT code for WoS article

001308620400001

EID of the result in the Scopus database

2-s2.0-85203354469