Envy-Free Allocations Respecting Social Networks
AAMAS, pp. 283-291, 2018.
Finding an envy-free allocation of indivisible resources to agents is a central task in many multiagent systems. Often, non-trivial envy-free allocations do not exist, and finding them can be a computationally hard task. Classic envy-freeness requires that every agent likes the resources allocated to it at least as much as the resources a...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)