Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods

This paper is concerned with various types of allocation problems in fair division of indivisible goods, aiming at maximin share, proportional share, and minimax share allocations. However, such allocations do not always exist, not even in very simple settings with two or three agents. A natural que...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Autonomous agents and multi-agent systems Ročník 32; číslo 6; s. 741 - 778
Hlavní autori:	Heinen, Tobias, Nguyen, Nhan-Tam, Nguyen, Trung Thanh, Rothe, Jörg
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2018 Springer Nature B.V
Predmet:	Allocations Approximation Artificial Intelligence Computer Science Computer Systems Organization and Communication Networks Economic models Mathematical analysis Minimax technique Reagents Software Engineering/Programming and Operating Systems User Interfaces and Human Computer Interaction Utilities Utility functions Computational social choice Approximation Maximin share Resource allocation Indivisible goods Minimax share Fair division Proportional share Complexity
ISSN:	1387-2532, 1573-7454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!