A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On Reachable Assignments in Cycles and Cliques
[article]
2020
arXiv
pre-print
The efficient and fair distribution of indivisible resources among agents is a common problem in the field of Multi-Agent-Systems. We consider a graph-based version of this problem called Reachable Assignments, introduced by Gourves, Lesca, and Wilczynski [AAAI, 2017]. The input for this problem consists of a set of agents, a set of objects, the agent's preferences over the objects, a graph with the agents as vertices and edges encoding which agents can trade resources with each other, and an
arXiv:2005.02218v1
fatcat:jgvp25egpnga3prq5owllfgpqq