AI Paper Atlas

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

Fair Division Through Information Withholding

Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Hejun Wang, Lirong Xia

AAAI 2020 · 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 Market or Round-Robin algorithm instead of MNW or EnvygraphEF1 algorithms · Synthetic binary valuations Bernoulli(0.7), n 5-10, m 5-20normalized regret for HEF(k)Improved
use MNW on Spliddit real-world data instead of synthetic dataMNW · Spliddit (2212 instances)normalized regretMixed
use Envygraph algorithm instead of RR, Market, MNWEF1 algorithms · Splidditnormalized regret and cumulative hidden goodsHurt
change Bernoulli parameter from 0.7 to 0.5 in synthetic valuationsEF1 algorithms · Synthetic data appendixrelative algorithm rankingNo clear effect
use Nash welfare maximizing allocation instead of optimal hiding allocationMNW · Chain instance with n agents and n goodsgoods hidden: 4 -> 1Hurt

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