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.
Fair Division: From Cake-Cutting to Dispute Resolution
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2024 2verdicts
UNVERDICTED 2representative citing papers
Polynomial-time algorithm for EF1 and maximal chore scheduling for two agents on interval graphs; existence via cycle-plus-triangles for identical valuations on paths; algorithm for dichotomous valuations with four or more agents.
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.
-
Fair Interval Scheduling of Indivisible Chores
Polynomial-time algorithm for EF1 and maximal chore scheduling for two agents on interval graphs; existence via cycle-plus-triangles for identical valuations on paths; algorithm for dichotomous valuations with four or more agents.