An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategy-proof if misreporting one's preference never produces a different social ordering that is between the original ordering...

The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function...

We generalize the traditional concept of single-peaked preference domains in two ways. First, we introduce the concept of a multiple single-peaked domain, where the set of alternatives is equipped with several underlying orderings with respect to which a preference can be single-peaked, and we...

Sprumont (1991) has established that the only allocation rule for the division problem that is strategy-proof, efficient, and anonymous is the uniform rule when the domain is the set of all possible profiles of continuous single-peaked preferences. Sprumont's characterization of the uniform rule...

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

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

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

In a voting model where the set of feasible alternatives is a subset of a product set $A = A_1\times\cdots\ldots{}A_m$ of $m$ finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over $A$, namely for the domains...

Consider a setting in which individual strict preferences need to be aggregated into a social strict preference relation. For two alternatives and an odd number of agents, it follows from May’s Theorem that the majority aggregation rule is the only one satisfying anonymity, neutrality, and...