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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 991; p. 114446
Main Authors:	Bliznets, Ivan, Bukov, Anton, Sagunov, Danil
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 12.04.2024
Subjects:	EF1 allocation Fair division Fixed-parameter tractable FPT-algorithm Fair division Fixed-parameter tractable EF1 allocation FPT-algorithm
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!