Strategy-proof voting for multiple public goods
研究了在多个有限类别产品集上，针对加性、完全可分离和弱可分离三种偏好域，刻画了所有防策略社会选择函数的集合。
In a voting model where the set of feasible alternatives is a subset of a product set $A = A_1\\times\\cdots\\ldots{}A_m$ of $m$ finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over $A$, namely for the domains of additive, completely separable, and weakly separable preferences over $A$.