Efficient Nearly-Fair Division with Capacity Constraints

We consider the problem of fairly and efficiently allocating indivisible items (goods or bads) under capacity constraints. In this setting, we are given a set of categorized items. Each category has a capacity constraint (the same for all agents), that is an upper bound on the number of items an age...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-02
Hauptverfasser:	Shoshan, Hila, Segal-Halevi, Erel, Hazon, Noam
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Pareto optimum Polynomials Reagents Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!