On finding an envy-free Pareto-optimal division

This paper describes an algorithm to find an (α-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-optimal and α-envy-f...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 1998-10, Vol.83 (2), p.291-311
Hauptverfasser:	REIJNIERSE, J. H, POTTERS, J. A. M
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Pareto optimum Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper describes an algorithm to find an (α-)envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-optimal and α-envy-free.
ISSN:	0025-5610 1436-4646
DOI:	10.1007/BF02680564