EUVIMEDEUVIMED entdecken
Crossref

Algorithmic fair allocation of indivisible items

Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu

ACM SIGecom Exchanges · 2022-07 · 20 (1) · 24-40

DOI: 10.1145/3572885.3572887 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM SIGecom Exchanges, online erschienen am 28.11.2022. Verfasst von Haris Aziz und 3 weiteren Autor:innen. Die Arbeit wurde bisher 34-mal zitiert (Crossref) und nennt 100 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The theory of algorithmic fair allocation is at the center of multi-agent systems and economics in recent decades due to its industrial and social importance. At a high level, the problem is to assign a set of items that are either goods or chores to a set of agents so that every agent is happy with what she obtains. In this survey, we focus on indivisible items, for which exact fairness as measured by envy-freeness and proportionality cannot be guaranteed. One main theme in the recent research agenda is designing algorithms that approximately achieve fairness criteria. We aim at presenting a comprehensive survey of recent progress through the prism of algorithms, highlighting the ways to relax fairness notions and common techniques to design algorithms, as well as the most interesting questions for future research.

Zitieren

APA

Aziz, H., Li, B., Moulin, H., & Wu, X. (2022). Algorithmic fair allocation of indivisible items. ACM SIGecom Exchanges, 20(1), 24-40. https://doi.org/10.1145/3572885.3572887

Vancouver

Aziz H, Li B, Moulin H, Wu X. Algorithmic fair allocation of indivisible items. ACM SIGecom Exchanges. 2022;20(1):24-40. doi:10.1145/3572885.3572887

BibTeX
@article{Aziz2022,
  author = {Aziz, Haris and Li, Bo and Moulin, Hervé and Wu, Xiaowei},
  title = {Algorithmic fair allocation of indivisible items},
  journal = {ACM SIGecom Exchanges},
  year = {2022},
  volume = {20},
  number = {1},
  pages = {24--40},
  doi = {10.1145/3572885.3572887}
}
Kostenlos starten →