We prove a general possibility result for collective decision problems where individual allocations are one-dimensional, preferences are single-peaked (strictly convex), and feasible allocation profiles cover a closed convex set. Special cases include the celebrated median voter theorem (Black...

Domains of individual preferences for which the well-known impossibility Theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. First, we introduce necessary and sufficient conditions for a domain to admit non-dictatorial, Pareto efficient and either strategy-proof...

Domains of individual preferences for which the well-known impossibility theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. To comprehend the limitations these results imply for social choice rules, we search for the largest domains that are possible. Here, we...

In the division problem with single-peaked preferences, it is well known that the uniform rule is robust to strategic manipulation. Furthermore, under efficiency and symmetry, it is the unique strategy-proof rule (Sprumont, 1991; Ching, 1994). We conversely analyze the consequences of strategic...