Abstract

We consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters' preferences are separable or additively representable.
Published as: Voting by Committees under Constraints in Journal of Economic Theory , Vol. 122, No. 2, 185-205, June, 2005