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.

We model the decision problems faced by the members of societies whose new members are determined by vote. We adopt a number of simplifying assumptions: the founders and the candidates are fixed; the society operates for $k$ periods and holds elections at the beginning of each period; one vote is...

This chapter surveys the literature on strategy proofness from a historical perspective. While I discuss the connections with other works on incentives in mechanism design, the main emphasis is on social choice models.

This chapter surveys the literature on strategy proofness from a historical perspective. While I discuss the connections with other works on incentives in mechanism design, the main emphasis is on social choice models.

We study the problem of a society choosing a subset of new members from a finite set of candidates (as in Barber?Sonnenschein, and Zhou, 1991). However, we explicitly consider the possibility that initial members of the society (founders) may want to leave it if they do not like the resulting...