跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

We study temporal fair division of indivisible items in both the goods and chores settings, with n≥2n \ge 2 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 1/n1/n approximation to temporal maximin share (TMMS), and a 1/(n−1)1/(n-1) 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 2−1/n2-1/n approximation to TMMS. Classical scheduling lower bounds based on fixed sequences carry over to chores TMMS, establishing the optimality of this factor for n=2,3n=2,3. For every n≥2n \ge 2, we further show that 2−1/n2-1/n is the optimal TMMS factor subject to exact TPROP1. For every fixed n≥3n \ge 3 and every finite β≥1β\ge 1, we construct an instance of chores admitting no ββ-TEF1 allocation.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 n≥2n \ge 2 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 1/n1/n approximation to temporal maximin share (TMMS), and a 1/(n−1)1/(n-1) 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 2−1/n2-1/n approximation to TMMS. Classical scheduling lower bounds based on fixed sequences carry over to chores TMMS, establishing the optimality of this factor for n=2,3n=2,3. For every n≥2n \ge 2, we further show that 2−1/n2-1/n is the optimal TMMS factor subject to exact TPROP1. For every fixed n≥3n \ge 3 and every finite β≥1β\ge 1, we construct an instance of chores admitting no ββ-TEF1 allocation.

查看此版本解读 →查看此版本原文 ↗