We investigate how individuals think groups should aggregate members' ordinal preferences - that is, how they interpret "the will of the people." In an experiment, we elicit revealed attitudes toward ordinal preference aggregation and classify subjects according to the rules they apparently...

We propose the concept of level r consensus as a useful property of a preference profile which considerably enhances the stability of social choice. This concept involves a weakening of unanimity, the most extreme form of consensus. It is shown that if a preference profile exhibits level r...

In this note, we use the technique of option sets to sort out the implications of coalitional strategyproofness in the spatial setting. We also discuss related issues and open problems.

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

In the article it is called the universality of the ordinal theory of social choice in question. It is shown that a voting exists that cannot be described on the base of ordinal theory, and to describe it the cardinal point of view is demanded. In absence of cardinal formalization of basic...

We analyze a discrete-time search problem in which committee members inspect alternatives sequentially over a finite search horizon. A collective decision to stop searching and accept the current alternative is reached when it is supported by a threshold number of individual votes. We...

Weighted committee games generalize n-player simple voting games to m ≥ 3 alternatives. The committee's aggregation rule treats votes anonymously but parties, shareholders, members of supranational organizations, etc. differ in their numbers of votes. Infinitely many vote distributions induce...

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

A vote-buying mechanism is such that each agent buys a quantity of votes x to cast for an alternative of her choosing, at a cost c(x), and the outcome is determined by the total number of votes cast for each alternative. In the context of binary decisions, we prove that the choice rules that can...