Dividing Splittable Goods Evenly and With Limited Fragmentation

A splittable good provided in n pieces shall be divided as evenly as possible among m agents, where every agent can take shares from at most F pieces. We call F the fragmentation and mainly restrict attention to the cases F = 1 and F = 2 . For F = 1 , the max–min and min–max problems are solvable in...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 82; H. 5; S. 1298 - 1328
1. Verfasser:	Damaschke, Peter
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2020 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Approximation algorithm Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Fair division Fragmentation Linear-time algorithm Mathematical analysis Mathematics of Computing Parameterized algorithm Parameters Theory of Computation Weighted graph 68Q25 68W40 05C85 Fair division Parameterized algorithm 68W25 Approximation algorithm Weighted graph 05C05 68P10 Linear-time algorithm
ISSN:	0178-4617, 1432-0541, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!