We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the suc- cessive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable...

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

How is group conflict over a public-good prize affected when individuals are active members of multiple groups simultaneously? To investigate this question, I introduce a simple model of Tullock group contest: individuals are partitioned into two groups in two dimensions each, the group-level...

In a framework allowing infinitely many individuals, I prove that coalitionally strategyproof social choice functions satisfy tops only. That is, they depend only on which alternative each indvidual prefers the most, not on which alternative she prefers the second most, the third, \dots, or the...

This paper proposes a way to allocate schools places conciliating Pareto efficiency and Equity. Taking as a starting point the recent reform proposed by the Boston School Committee, we suggest to allow the schools to prioritize only a reduced group of students and use a common priority order for...

Lalley and Weyl (2016) propose a mechanism for binary collective decisions, Quadratic Voting, and prove its approximate efficiency in large populations in a stylized environment. They motivate their proposal substantially based on its greater robustness when compared with pre-existing efficient...

A committee chooses whether to approve a proposal that some members may consider ethical. Members who vote for the proposal receive expressive utility, and all pay a cost if the proposal is accepted. Committee members have different depths of reasoning. The model predicts that features that...

In this paper, we reexamine Eliaz's results (2002) of fault tolerantimplementation on one hand and we extend theorems 1 and 2 of Doghmi and Ziad (2008a) to bounded rationality environments, on the other. We identify weak versions of thek-no veto power condition, in conjunction with unanimity and...

In this paper, we study the Nash implementation in an allocation problem with single-dipped preferences. We show that, with at least three agents, Maskin monotonicity is necessary and sufficient for implementation. We examine the implementability of various social choice correspondences (SCCs)...

We conduct an experiment to uncover the reasons behind the typically large behavioral variation and low explanatory power of Nash equilibrium observed in Tullock contests. In our standard contest treatment, only 7% of choices are consistent with Nash equilibrium which is in line with the...