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

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

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

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

In this paper, we study individual incentives to report preferences truthfully for the special case when individuals have dichotomous preferences on the set of alternatives and preferences are aggregated in form of scoring rules. In particular, we show that (a) the Borda Count coincides with...

We consider collective choice problems where a set of agents have to choose an alternative from a finite set and agents may or may not become users of the chosen alternative. An allocation is a pair given by the chosen alternative and the set of its users. Agents have gregarious preferences over...

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges...

We consider situations in which agents are not able to completely distinguish between all alternatives. Preferences respect individual objective indifferences if any two alternatives are indifferent whenever an agent cannot distinguish between them. We present necessary and sufficient conditions...