Introduces EF1-Restoration for dynamic fair division and maps its complexity: polynomial algorithms for identical monotone valuations on goods or chores, NP-hardness for additive and binary cases, and PSPACE-completeness for monotone binary valuations.
On the structure of envy-free orientations on graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2verdicts
UNVERDICTED 2representative citing papers
Presents positive and negative results on exact and approximate MMS and PMMS allocations for additive, XOS, and subadditive valuations in the graphical multi-graph model.
citing papers explorer
-
Fair Division in a Variable Setting
Introduces EF1-Restoration for dynamic fair division and maps its complexity: polynomial algorithms for identical monotone valuations on goods or chores, NP-hardness for additive and binary cases, and PSPACE-completeness for monotone binary valuations.
-
Exact and approximate maximin share allocations in multi-graphs
Presents positive and negative results on exact and approximate MMS and PMMS allocations for additive, XOS, and subadditive valuations in the graphical multi-graph model.