EUVIMEDEUVIMED entdecken
Crossref

Repeated Fair Allocation of Indivisible Items

Ayumi Igarashi, Martin Lackner, Oliviero Nardi, Arianna Novaro

Proceedings of the AAAI Conference on Artificial Intelligence · 24.03.2024 · 38 (9) · 9781-9789

DOI: 10.1609/aaai.v38i9.28837 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 24.03.2024. Verfasst von Ayumi Igarashi und 3 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The problem of fairly allocating a set of indivisible items is a well-known challenge in the field of (computational) social choice. In this scenario, there is a fundamental incompatibility between notions of fairness (such as envy-freeness and proportionality) and economic efficiency (such as Pareto-optimality). However, in the real world, items are not always allocated once and for all, but often repeatedly. For example, the items may be recurring chores to distribute in a household. Motivated by this, we initiate the study of the repeated fair division of indivisible goods and chores, and propose a formal model for this scenario. In this paper, we show that, if the number of repetitions is a multiple of the number of agents, there always exists a sequence of allocations that is proportional and Pareto-optimal. On the other hand, irrespective of the number of repetitions, an envy-free and Pareto-optimal sequence of allocations may not exist. For the case of two agents, we show that if the number of repetitions is even, it is always possible to find a sequence of allocations that is overall envy-free and Pareto-optimal. We then prove even stronger fairness guarantees, showing that every allocation in such a sequence satisfies some relaxation of envy-freeness. Finally, in case that the number of repetitions can be chosen freely, we show that envy-free and Pareto-optimal allocations are achievable for any number of agents.

Zitieren

APA

Igarashi, A., Lackner, M., Nardi, O., & Novaro, A. (2024). Repeated Fair Allocation of Indivisible Items. Proceedings of the AAAI Conference on Artificial Intelligence, 38(9), 9781-9789. https://doi.org/10.1609/aaai.v38i9.28837

Vancouver

Igarashi A, Lackner M, Nardi O, Novaro A. Repeated Fair Allocation of Indivisible Items. Proceedings of the AAAI Conference on Artificial Intelligence. 2024;38(9):9781-9789. doi:10.1609/aaai.v38i9.28837

BibTeX
@article{Igarashi2024,
  author = {Igarashi, Ayumi and Lackner, Martin and Nardi, Oliviero and Novaro, Arianna},
  title = {Repeated Fair Allocation of Indivisible Items},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2024},
  volume = {38},
  number = {9},
  pages = {9781--9789},
  doi = {10.1609/aaai.v38i9.28837}
}
Kostenlos starten →