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

The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...

Which decision rule should we use to make a binary collective choice? While voting procedures are applied ubiquitously, they are criticized for being inefficient. Using monetary transfers, efficient choices can be made at the cost of a budget imbalance. Is it optimal to do so? And why are...