Balanced partitions exist that are O(max{√Δ, k²} ln n)-approximately envy-free and (k + o(k))-approximately core, with efficient computation under relaxed balance and stronger (1.618 + o(1))-core for k=2.
arXiv preprint arXiv:2303.06212 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2verdicts
UNVERDICTED 2representative citing papers
A new quantile valuation model for indivisible goods is defined and used to derive complexity classifications plus approximation and exact algorithms for utilitarian and egalitarian welfare maximization under balanced vs. unbalanced constraints.
citing papers explorer
-
Some Improved Results on Fair and Balanced Graph Partitions
Balanced partitions exist that are O(max{√Δ, k²} ln n)-approximately envy-free and (k + o(k))-approximately core, with efficient computation under relaxed balance and stronger (1.618 + o(1))-core for k=2.
-
Maximum Welfare Allocations under Quantile Valuations
A new quantile valuation model for indivisible goods is defined and used to derive complexity classifications plus approximation and exact algorithms for utilitarian and egalitarian welfare maximization under balanced vs. unbalanced constraints.