Competitive Fair Division
提出一种称为“缺口程序”的公平分配方法，用于将不可分割物品分配给多个玩家，确保价格非负、帕累托最优、单调性等性质，并讨论其应用。
Several indivisible goods are to be divided among two or more players, whose bids for the goods determine their prices. An equitable assignment of the goods at competitive prices is given by a fair-division procedure, called the Gap Procedure, that ensures (1) nonnegative prices that never exceed the bid of the player receiving the good; (2) Pareto optimality, though coupled with possible envy; (3) monotonicity, such that higher bids never hurt in obtaining a good; (4) sincere bids that preclude negative utility; and (5) prices that are partially independent of the amounts bid (as in a Vickrey auction). A variety of applications are discussed.