Pith. sign in

REVIEW 2 cited by

Fair Division of Indivisible Goods: A Survey

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.07551 v2 pith:7WO2PJL6 submitted 2022-02-15 cs.GT

Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris This is my paper
classification cs.GT
keywords fairbeencasedivisionfairnessfocusingindivisibleresources
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Allocating resources to individuals in a fair manner has been a topic of interest since the ancient times, with most of the early rigorous mathematical work on the problem focusing on infinitely divisible resources. Recently, there has been a surge of papers studying computational questions regarding various different notions of fairness for the indivisible case, like maximin share fairness (MMS) and envy-freeness up to any good (EFX). We survey the most important results in the discrete fair division literature, focusing on the case of additive valuation functions and paying particular attention to the progress made in the last 10 years.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Strict Fairness at What Cost? Envy-Free Contracts with Subsidies

    cs.GT 2026-06 unverdicted novelty 7.0 of 10

    Introduces EFS contracts restoring strict envy-freeness via subsidies, proving a tight n^Θ(n) PoF bound, NP-hardness in general, and poly-time solvability for constant tasks.

  2. Perpetually Fair Assignments Via Balanced Sequences of Permutations

    math.CO 2026-02 conditional novelty 7.0 of 10

    Balanced permutation sequences guarantee ordinal PROP1 fairness after every day where they exist, but they exist only for n≤11 (none beyond 61), and full PROP2 existence remains open.

Pith tools