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

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

We study the consequences of positive correlation of beliefs in the design of voting rules in a model with an arbitrary number of voters. We propose a notion of positive correlation, based on the likelihood of agreement of the k best alternatives (for any k) of two orders called TS correlation....