For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of...

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to...

A social choice function may or may not satisfy a desirable property depending on its domain of definition. For the same reason, different conditions may be equivalent for functions defined on some domains, while different in other cases. Understanding the role of domains is therefore a crucial...

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...

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and...

A social choice function is group strategy-proof on a domain if no group of agents can manipulate its final outcome to their own benefit by declaring false preferences on that domain. Group strategy-proofness is a very attractive requirement of incentive compatibility. But in many cases it is...

We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three nec- essary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions...

We identify in this paper two conditions that characterize the domain of single-peaked preferences on the line in the following sense: a preference profile satisfies these two properties if and only if there exists a linear order $L$ over the set of alternatives such that these preferences are...

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.

This paper 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 article has been prepared for the Handbook of Social Choice and Welfare,...