Thumbnail

On Fairness via Picking Sequences in Allocation of Indivisible Goods

Gourvès, Laurent; Lesca, Julien; Wilczynski, Anaëlle (2021), On Fairness via Picking Sequences in Allocation of Indivisible Goods, in Fotakis, Dimitris; Insua, David Ríos, Algorithmic Decision Theory, Springer, p. 258-272. 10.1007/978-3-030-87756-9_17

View/Open
Type
Communication / Conférence
Date
2021
Conference title
7th International Conference, ADT 2021
Conference date
2021-11
Conference city
Toulouse
Conference country
France
Book title
Algorithmic Decision Theory
Book author
Fotakis, Dimitris; Insua, David Ríos
Publisher
Springer
ISBN
978-3-030-87755-2
Number of pages
441
Pages
258-272
Publication identifier
Metadata
Show full item record
Author(s)
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Lesca, Julien
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Wilczynski, Anaëlle
Abstract (EN)
Among the fairness criteria for allocating indivisible resources to a group of agents, some are based on minimum utility levels. These levels can come from a specific allocation method, such as maximin fair-share criterion which is based on the cut-and-choose protocol. We propose to analyze criteria whose minimum utility levels are inspired by picking sequences, a well-established protocol for allocating indivisible resources. We study these criteria and investigate their connections with known fairness criteria, enriching the understanding of fair allocation of indivisible goods.
Subjects / Keywords
Fair division; Resource allocation; Computational social choice