We consider the problem of choosing a level of a public good on an interval of the real line among a group of agents. A probabilistic rule chooses a probability distribution over the interval for each preference profile. We investigate strategy-proof probabilistic rules in the case where...

This paper analyzes how to choose a delegation, a committee to represent a society such as in a peace conference. We propose normative conditions and seek optimal, consistent, neutral, and non-manipulable ways to choose a delegation. We show that a class of threshold rules are characterized by...

In a voting model where the set of feasible alternatives is a subset of a product set $A = A_1\times\cdots\ldots{}A_m$ of $m$ finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over $A$, namely for the domains...

We study strategy-proof rules for choosing between two alternatives. We consider the full preference domain which allows for indifference. In this framework, for strategy proof rules, ontoness does not imply efficiency. We weaken the requirement of efficiency to ontoness and characterizes the...

Consider a setting in which individual strict preferences need to be aggregated into a social strict preference relation. For two alternatives and an odd number of agents, it follows from May’s Theorem that the majority aggregation rule is the only one satisfying anonymity, neutrality, and...

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

This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous, and strategy-proof on a maximal single-crossing domain if and only if it is...

We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions...

We study a legislative bargaining game in which failure to agree in a given round may result in a breakdown of negotiations. In that case, each player receives an exogenous `disagreement value'. We characterize the set of stationary subgame perfect equilibria under all q-majority rules. Under...

We present a model of bargaining in which a committee searches over the policy space, successively amending the default by voting over proposals. Bargaining ends when proposers are unable or unwilling to amend the existing default, which is then implemented. We characterize the policies which...