EFX allocations always exist for general monotone valuations in bipartite multigraphs, in multigraphs where each agent has at most ceil(n/4)-1 neighbors, and in multigraphs whose shortest non-parallel cycle has length at least 6.
A discrete and bounded envy-free cake cutting protocol for four agents
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the existence of EFX allocations in multigraphs
EFX allocations always exist for general monotone valuations in bipartite multigraphs, in multigraphs where each agent has at most ceil(n/4)-1 neighbors, and in multigraphs whose shortest non-parallel cycle has length at least 6.