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.
The perfect matching reconfiguration problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
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.