We propose a class of decisive collective choice rules that rely on a linear ordering to partition the majority relation into two acyclic relations. The first of these relations is used to pare down the set of the feasible alternatives into a shortlist while the second is used to make a final...

We study decision rules for committees that repeatedly take a binary decision. Committee members are privately informed about their payoffs and monetary transfers are not feasible. In static environments, the only strategy-proof mechanisms are voting rules which are criticized for being...

Approval voting allows voters to support as many candidates as they wish. One advantage of the method is that voters have weak or no incentives to vote insincerely. However, the exact meaning of this statement depends on how the voters' preferences over candidates are extended to sets. We show...

This paper introduces excluding outlier voters (EOV) as a general mechanism for revealing true preferences in social choices, and for discouraging voters from strategic voting and manipula-tion. This mechanism is general in that it can be implemented with any voting system. The paper...

When preferences are single-peaked (Black (1948),Black et al. (1958)) or group separable Ballester and Haeringer (2011), majority voting equilibria exist. Group separability has probably not received as much attention as single-peak separability because there are no intuitive assumptions about...

Approval voting allows voters to support as many candidates as they wish. One advantage of the method is that voters have weak or no incentives to vote insincerely. However, the exact meaning of this statement depends on how the voters' preferences over candidates are extended to sets. We show...

There are many situations where different groups make collective decisions by voting in an assembly or committee in which each group is represented by a single person. There is a great deal of theoretical, normative literature on the question of what voting system such an assembly should use,...

We study a vote buying setup where a committee votes on a proposal important to the vote buyer. We characterize the cheapest combination of bribes that guarantees the proposal's passing in different voting environments. We find that for both simultaneous and sequential votes, the vote buyer...

Commitment voting is a mechanism for signalling intensity of preferences and long-term commitment to governance decisions in proof of stake blockchains. In commitment voting, the voting weight of a vote in any given election is determined by 1) the amount of tokens under a voters control and 2)...

We analyze a vote-buying model where the members of a committee vote on a proposal important to a vote buyer. Each member incurs a privately-drawn disutility if the proposal passes. We characterize the cheapest combination of bribes that guarantees the proposal passes in all equilibria. When...