We generalize the classic problem of fairly allocating indivisible goods to
the problem of \emph{fair public decision making}, in which a decision must be
made on several social issues simultaneously, and, unlike the classic setting,
a decision can provide positive utility to multiple players. We extend the
popular fairness notion of proportionality (which is not guaranteeable) to our
more general setting, and introduce three novel relaxations ---
\emph{proportionality up to one issue, round robin share, and pessimistic
proportional share} --- that are also interesting in the classic goods
allocation setting. We show that the Maximum Nash Welfare solution, which is
known to satisfy appealing fairness properties in the classic setting,
satisfies or approximates all three relaxations in our framework. We also
provide polynomial time algorithms and hardness results for finding allocations
satisfying these axioms, with or without insisting on Pareto optimality.

本文将不可分割资源公平分配的问题扩展到了一个决策必须在多个社会问题上同时做出的公平公共决策问题，并引入了三种新的松弛解法，最终证明了最大纳什福利解决方案适用于所有三个松弛解法，并提供了满足这些公理的分配的多项式时间算法和难度结果。