Proportional Borda allocations
研究在不可分割物品分配中实现比例公平，利用博尔达规则从序数排名中简化价值确定，证明在特定条件下比例分配存在且易于计算。
In this paper we study the allocation of indivisible items among a group of agents, a problem which has received increased attention in recent years, especially in areas such as computer science and economics. A major fairness property in the fair division literature is proportionality, which is satisfied whenever each of the n agents receives at least $$\frac{1}{n}$$ of the value attached to the whole set of items. To simplify the determination of values of (sets of) items from ordinal rankings of the items, we use the Borda rule, a concept used extensively and well-known in voting theory. Although, in general, proportionality cannot be guaranteed, we show that, under certain assumptions, proportional allocations of indivisible items are possible and finding such allocations is computationally easy.