AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

When Do Envy-Free Allocations Exist?

Pasin Manurangsi, Warut Suksompong

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Fair division of indivisible goods

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use threshold matching with removal to construct a balanced allocationRandom additive-utility fair division · m=rn for integer r≥2envy-free allocation existence: m≥2nImproved
Have item count fall between consecutive multiples of n, with remainder away from either endpointRandom additive-utility fair division · m ∈ [rn + n^ε, (r + 1)n - n^ε], r≤c log n/log log nenvy-free allocation existence: r ≤ c log n/log log nHurt
Use welfare maximization by assigning each item to its highest-utility agentRandom additive-utility fair division · m = n log n - ω(n)envy-free allocation: m = n log n - ω(n)Hurt
Use threshold matching without the removal step (ablation)Threshold matching for r=2 · m=2nenvy-free allocationHurt
Use threshold matching without the removal step (ablation)Threshold matching for r≥3 · m=rn, 3≤r≤e^{n^{0.1}}edges removed by the removal step: E_{≥τ} = E*_{≥τ}No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy