Chore division is a class of fair division problems in which some undesirable "resource" must be shared among a set of participants, with each participant wanting to get as little as possible. Typically the set of participants is fixed and known at the outset. This paper introduces a novel variant, called sequential online chore division (SOCD), in which participants arrive and depart online, while the chore is being performed: both the total number of participants and their arrival/departure times are initially unknown. In SOCD, exactly one agent must be performing the chore at any give time (e.g. keeping lookout), and switching the performer incurs a cost. In this paper, we propose and analyze three mechanisms for SOCD: one centralized mechanism using side payments, and two distributed ones that seek to balance the participants' loads. Analysis and results are presented in a domain motivated by autonomous vehicle convoy formation, where the chore is leading the convoy so that all followers can enjoy reduced wind resistance.

中文翻译：

---

无人驾驶车队编队顺序在线杂务部

杂务分工是一类公平分工的问题，其中必须在一组参与者之间共享一些不良的“资源”，而每个参与者都希望获得尽可能少的资源。通常，参与者的集合是固定的，一开始就是已知的。本文介绍了一种新颖的变体，称为顺序在线杂项划分（SOCD），其中参与者在执行杂项的同时在线到达和离开：参与者的总数及其到达/离开的时间最初是未知的。在SOCD中，恰恰有一个代理商必须在任何给定时间（例如，保持监视）执行杂务，并且更换执行者会产生成本。在本文中，我们提出并分析了SOCD的三种机制：一种使用边际支付的集中化机制，以及两种试图平衡参与者的支付的分布式机制。负载。分析和结果显示在一个由自动驾驶车队编队推动的领域中，其中杂务领导着车队，因此所有追随者均可享受降低的风阻。