← 研踪 PaperTrailarXiv:2611.23782 · v1
Temporal Fair Division: Simultaneous Guarantees for Goods and Chores
首次提交 2026-11-18 11:39
版本更新 2026-11-18 11:39
雷达观测 2026-11-19 19:08
摘要
We study temporal fair division of indivisible items in both the goods and chores settings, with agents and nonnegative additive values or costs. Items arrive one at a time and must be assigned immediately and irrevocably. The arrival order and all agents' values or costs are known in advance, and the cumulative allocation must satisfy the fairness requirements after each arrival. For goods, we give a polynomial-time algorithm that simultaneously achieves exact temporal proportionality up to one item (TPROP1), a approximation to temporal maximin share (TMMS), and a approximation to temporal envy-freeness up to one item (TEF1). The TMMS factor is optimal. For chores, we give a polynomial-time algorithm that simultaneously achieves exact TPROP1 and a approximation to TMMS. Classical scheduling lower bounds based on fixed sequences carry over to chores TMMS, establishing the optimality of this factor for . For every , we further show that is the optimal TMMS factor subject to exact TPROP1. For every fixed and every finite , we construct an instance of chores admitting no -TEF1 allocation.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 11:39 · 最新观测版本
Temporal Fair Division: Simultaneous Guarantees for Goods and Chores
We study temporal fair division of indivisible items in both the goods and chores settings, with agents and nonnegative additive values or costs. Items arrive one at a time and must be assigned immediately and irrevocably. The arrival order and all agents' values or costs are known in advance, and the cumulative allocation must satisfy the fairness requirements after each arrival. For goods, we give a polynomial-time algorithm that simultaneously achieves exact temporal proportionality up to one item (TPROP1), a approximation to temporal maximin share (TMMS), and a approximation to temporal envy-freeness up to one item (TEF1). The TMMS factor is optimal. For chores, we give a polynomial-time algorithm that simultaneously achieves exact TPROP1 and a approximation to TMMS. Classical scheduling lower bounds based on fixed sequences carry over to chores TMMS, establishing the optimality of this factor for . For every , we further show that is the optimal TMMS factor subject to exact TPROP1. For every fixed and every finite , we construct an instance of chores admitting no -TEF1 allocation.
查看此版本解读 →查看此版本原文 ↗