Temporal fair division allows TEF1 with a scheduling buffer of size n/2 for identical days but shows constant-factor TEFX approximations and TMMS are impossible in general.
Proof.If an allocation is TEFX,∀j∈[N], v i(Ai)≥v i(Aj\{g}),∀g∈A j
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Temporal Fair Division of Indivisible Goods with Scheduling
Temporal fair division allows TEF1 with a scheduling buffer of size n/2 for identical days but shows constant-factor TEFX approximations and TMMS are impossible in general.