Fairly taking turns
研究了当每个参与者都足够耐心时，如何公平分配一系列时间槽。针对不同人数，构造了无嫉妒、按比例或近似公平的分配方案，并探讨了每期近似公平、策略证明性和计算简单性。
We investigate the fair division of a sequence of time slots when each agent is sufficiently patient. If agents have identical preferences, then we construct perfectly equitable and efficient allocations. Otherwise, (i) if there are two agents, then we construct envy-free allocations, (ii) if there are three agents, then we construct proportional allocations, and (iii) in general, we construct approximately fair allocations. Finally, we investigate achieving approximate fairness at each time period, strategy-proofness, and a notion of computational simplicity.