We identify the maximal number of people who are harmed when a social choice rule is manipulated. If there are n individuals, then for any <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation> greater than 0 and less than n, there is a neutral rule for which the maximal number is <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation>, and there is an anonymous rule for which the maximum...</equationsource></inlineequation></equationsource></inlineequation>

Assuming an odd number of voters, E. S. Maskin recently provided a characterization of majority rule based on full transitivity. This paper characterizes majority rule with a set of axioms that includes two of Maskin's, dispenses with another, and contains weak versions of his other two axioms....

A feasible alternative x is a strong Condorcet winner if for every other feasible alternative y there is some majority coalition that prefers x to y. Let <InlineEquation ID="Equ1"> <EquationSource Format="TEX"><![CDATA[${\cal L}_{C}$]]></EquationSource> </InlineEquation> (resp., <InlineEquation ID="Equ2"> <EquationSource Format="TEX"><![CDATA[$\wp_{C})$]]></EquationSource> </InlineEquation> denote the set of all profiles of linear (resp., merely asymmetric) individual preference relations for which a strong Condorcet...</equationsource></inlineequation></equationsource></inlineequation>

The individual preference domain is the family of profiles of economic preferences on the set of allocations of public or private goods, or both. The agenda domain assumption allows for a finite lower bound on the size of a feasible set. If a social choice correspondence satisfies nonimposition,...

If only the strict part of social preference is required to be transitive then Independence of Irrelevant Alternatives implies that there is a coalition containing all but one individual that cannot force x to be socially ranked above y for at least half of the pairs of alternatives (x,y).

We characterize strategy-proof social choice procedures when choice sets need not be singletons. Sets are compared by leximin. For a strategy-proof rule g, there is a positive integer k such that either (i) the choice sets g(r) for all profiles r have the same cardinality k and there is an...