AI Paper Atlas

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

Group Fairness for the Allocation of Indivisible Goods

Vincent Conitzer, Rupert Freeman, Nisarg Shah, Jennifer Wortman Vaughan

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
Vary valuation magnitude K from 100 to 1000Local search · Synthetic instances, n=5, m=15steps to converge and Pareto/max Nash shareNo clear effect
Increase number of goods m (n=5)Local search · Synthetic instancessteps to convergeHurt
Increase number of players n (m=3n)Local search · Synthetic instancessteps to convergeHurt
Increase goods from m=n=5 to m=2n=10Local search · Synthetic instances, n=5share of max Nash welfare allocations: very small percentage -> nearly 60%Improved
Increase goods m beyond 2nLocal search · Synthetic instances, n=5share of max Nash welfare allocationsNo clear effect
Increase number of players n (m=3n)Local search · Synthetic instancesshare of max Nash welfare allocations: nearly 80% -> unlikelyHurt
Increase number of players n (m=3n)Local search · Synthetic instancesshare of Pareto optimal allocationsNo 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