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

This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous and strategy-proof on a maximal single-crossing domain if and only if it is...

This paper takes a mechanism design approach to federalism and assumes that local preferences are the private information of local jurisdictions. Contractual federalism is defined as a strategy-proof contract among the members of the federation supervised by a benevolent but not omniscient...

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number k of public facilities to be located. We consider public facilities that do not su¤er from congestion and are non-excludable. We provide a characterization of...

Public school systems generally use one of the three competing mechanisms – the Boston mechanism, the deferred acceptance mechanism and the top trading cycle mechanism – for assigning students to specific schools. Although the literature generally claims that the Boston mechanism is Pareto...

We study resource allocation with multi-unit demand, such as the allocation of courses to students. In contrast to the case of single-unit demand, no stable mechanism, not even the (student-proposing) deferred acceptance algorithm, achieves desirable properties: it is not strategy-proof and the...

In a model with finitely many agents who have single-dipped Euclidean preferences on a disc in the Euclidean plane, a rule assigns to each profile of reported dips a point of the disc. It is proved that any strategy-proof and Pareto optimal rule is dictatorial. This framework models situations...

I consider whether the agentsʼ reluctance to make a large lie is helpful for the rule designer to construct a nonmanipulable rule. For this purpose, I study an axiom, called AM-proofness, saying that manipulation cannot occur through preferences adjacent to the sincere one. Through examples, I...

In this paper, we investigate domains that admit “well-behaved” strategy-proof social choice functions. We show that if the number of voters is even, then every domain that satisfies a richness condition and admits an anonymous, tops-only, unanimous and strategy-proof social choice function,...

We show that in pure exchange economies there exists no Pareto-efficient and strategy-proof allocation mechanism that ensures positive consumption for all agents. We also show that a Pareto-efficient, strategy-proof, and non-bossy allocation mechanism is dictatorial. We further show that in...