This paper proves stronger versions of the Gibbard random dictatorship theorem using induction on the number of voters. It shows that when there are at least three voters, every random social choice function defined on a domain satisfying a Free Triple at the Top property and satisfying a weak...

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