We study deterministic voting mechanisms by considering an ordinal notion of Bayesian incentive compatibility (OBIC). If the beliefs of agents are independent and generic, we show that any OBIC mechanism is dominant strategy incentive compatible under an additional mild requirement. Our result...

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 deterministic voting mechanisms by considering an ordinal notion of Bayesian incentive compatibility (OBIC). If the beliefs of agents are independent and generic, we show that any OBIC mechanism is dominant strategy incentive compatible under an additional mild requirement. Our result...

We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probability can be implemented as a convex combination of two families...