Fair division with minimal withheld information in social networks

We present a study of a few graph-based problems motivated by fair allocation of resources in a social network. The central role in the paper is played by the following problem: What is the largest number of items we can allocate to the agents in the given social network so that each agent hides at...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 991; S. 114446
Hauptverfasser:	Bliznets, Ivan, Bukov, Anton, Sagunov, Danil
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 12.04.2024
Schlagworte:	EF1 allocation Fair division Fixed-parameter tractable FPT-algorithm Fair division Fixed-parameter tractable EF1 allocation FPT-algorithm
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!