How competition affects schools' performances: Does specification matter?

If the number of individuals is odd, majority rule is the only non-dictatorial strategy-proof social choice rule on the domain of linear orders that admit a Condorcet winner (Campbell and Kelly, 2003). This paper shows that the claim is false when the number of individuals is even, and provides a counterpart to the theorem for the even case.     

The Borda rule,Condorcet consistency and Condorcet stability

Summary. The Borda rule is known to be the least vulnerable scoring rule to Condorcet inconsistency, Saari (2000). Such inconsistency occurs when the Condorcet winner (the alternative which is preferred to any other alternative by a simple majority) is not selected by the Borda rule. This note exposes the relationship between the Borda rule and the Condorcet q-majority principle as well as the Condorcet q-majority voting rule. The main result establishes that the Borda rule is Condorcet q-majority consistent when where k is the number of alternatives. The second result establishes that is the minimal degree of majority decisiveness corresponding to the Borda rule under sincere voting. The same majority is required to ensure decisiveness under the Borda rule and to ensure that a q-rule (the generalized q-majority Condorcet rule) is a voting rule. Received: April 8, 2002; revised version: July 17, 2002 Correspondence to:S. Nitzan     

Winning probabilities in a pairwise lottery system with three alternatives

Summary. The pairwise lottery system is a multiple round voting procedure which chooses by lot a winner from a pair of alternatives to advance to the next round where in each round the odds of selection are based on each alternatives majority rule votes. We develop a framework for determining the asymptotic relative likelihood of the lottery selecting in the final round the Borda winner, Condorcet winner, and Condorcet loser for the three alternative case. We also show the procedure is equivalent to a Borda lottery when only a single round of voting is conducted. Finally, we present an alternative voting rule which yields the same winning probabilities as the pairwise lottery in the limiting case as the number of rounds of the pairwise lottery becomes large.Received: 5 June 2003, Revised: 17 June 2004, JEL Classification Numbers: D71. Correspondence to: Jac C. HeckelmanWe thank Keith Dougherty and Andrew Yates for their comments.     

POSITIVELY RESPONSIVE COLLECTIVE CHOICE RULES AND MAJORITY RULE: A GENERALIZATION OF MAY'S THEOREM TO MANY ALTERNATIVES

May's theorem shows that if the set of alternatives contains two members, an anonymous and neutral collective choice rule is positively responsive if and only if it is majority rule. We show that if the set of alternatives contains three or more alternatives only the rule that assigns to every problem its strict Condorcet winner satisfies the three conditions plus Nash's version of “independence of irrelevant alternatives” for the domain of problems that have strict Condorcet winners. We show also that no rule satisfies the four conditions for domains that are more than slightly larger.     

Strategy-proof preference aggregation: Possibilities and characterizations

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategy-proof if misreporting one's preference never produces a different social ordering that is between the original ordering and one's own preference. After describing two examples of manipulable rules, we study in some detail three classes of strategy-proof rules: (i) rules based on a monotonic alteration of the majority relation generated by the preference profile; (ii) rules improving upon a fixed status-quo; and (iii) rules generalizing the Condorcet–Kemeny aggregation method.     

Preference revelation with a limited number of indifference classes

Suppose that g is a strategy-proof social choice rule on the domain of all profiles of complete and transitive binary relations that have exactly m indifference classes. If and the range of g has three or more members, then g is dictatorial. If m = 2, then for any set X of feasible alternatives, there exist non-dictatorial and strategy-proof rules that are sensitive to the preferences of every individual and which have X as range.     

The Copeland rule and Condorcet’s principle

Summary. The purpose of this note is to shed some light on the relationship between the Copeland rule and the Condorcet principle in those cases where there does not exist a Condorcet winner. It will be shown that the Copeland rule ranks alternatives according to their distances to being a Condorcet winner.Received: 30 July 2003, Revised: 31 December 2003, JEL Classification Numbers: D70, D71.Christian Klamler: I am very grateful to Daniel Eckert and Nick Baigent for their helpful comments.     

The dynamics of distributive politics

We study dynamic committee bargaining over an infinite horizon with discounting. In each period, a committee proposal is generated by a random recognition rule, the committee chooses between the proposal and a status quo by majority rule, and the voting outcome in period t becomes the status quo in period t + 1. We study symmetric Markov equilibria of the resulting game and conduct an experiment to test hypotheses generated by the theory for pure distributional (divide-the-dollar) environments. In particular, we investigate the effects of concavity in the utility functions, the existence of a Condorcet winning alternative, and the discount factor (committee “impatience”). We report several new findings. Voting behavior is selfish and myopic. Status quo outcomes have great inertia. There are strong treatment effects that are in the direction predicted by the Markov equilibrium. We find significant evidence of concave utility functions.     

Constant scoring rules,condorcet criteria and single-peaked preferences

Summary A constant scoring rule asks each individual to vote for a given (and constant) number of alternatives and the alternative with the most votes is elected. A sequential constant scoring rule applies this principle in a process of sequential elimination. Constant scoring rules as well as sequential constant scoring rules fail to satisfy Condorcet criteria when individual preferences are unrestricted. The purpose of this paper is to show that, if we assume that preferences are single-peaked, then some constant scoring rules satisfy the Condorcet loser criterion and some sequential constant scoring rules satisfy the Condorcet winner criterion. The results we provide make possible the identification of these rules.I thank Maurice Salles and two anonymous referees for their helpful comments. The usual disclaimers apply.     

Redistributive policies with heterogeneous social preferences of voters

There is growing evidence on the roles of fairness and other-regarding preferences as fundamental human motives. Call voters with fair preferences, as in Fehr and Schmidt (1999), fair-voters. By contrast, traditional political economy models are based on selfish-voters who derive utility solely from “own” payoff. In a general equilibrium model with endogenous labor supply, a mixture of fair and selfish voters choose optimal policy through majority voting. First, we show that majority voting produces a unique winner in pairwise contests over feasible policies (the Condorcet winner). Second, we show that a preference for greater fairness leads to greater redistribution. An increase in the number of fair voters can also lead to greater redistribution. Third, we show that in economies where the majority are selfish-voters, the decisive policy could be chosen by fair-voters, and vice versa. Fourth, while choosing labor supply, even fair voters behave exactly like selfish voters. We show how this apparently inconsistent behavior in different domains (voting and labor supply) can be rationalized within the model.     

A recursion relation for the probability of the paradox of voting

For alternatives x_i, i = 1,…, m, giving rise to m! linear preference orderings of which one is selected independently by each of N voters, a recursion relation is developed which expresses the probability that x_i is the Condorcet winner when there are N voters in terms of the probability of this event when there are N ? 1 voters. Hence the probabilities of the paradox of voting when N is odd, and of Condorcet indecision when N is even may be obtained. The relationship holds for any set of probabilities, or culture, governing the selection of the preference orderings by the voters.     

Extraneous Alternatives And Strategy-Proofness

It is well known that the Gibbard–Satterthwaite theorem cannot be circumvented by adding extraneous alternatives that are included in the individual preference information but are never selected. We generalize this by proving that, for any domain on which every strategy-proof rule is dictatorial, the addition of extraneous alternatives will not permit the construction of a non-dictatorial and strategy-proof rule if the new domain is a product set. We show how this result, and our other theorem, can be applied to seven families of social choice situations, including those in which more than one alternative is selected.     

Inefficiency of Strategy-Proof Rules for Pure Exchange Economies

In his pioneering article, (in “Decision and Organization” (C. B. McGuire and R. Radner, Eds.), pp. 297-336, North-Holland, Amsterdam, 1972) Hurwicz establishes that there is no strategy-proof, Pareto-efficient, and individually rational rule for pure exchange economies with two agents and two goods, provided that the domain includes a sufficiently wide class of classical preferences. In this article, we extend his result to pure exchange economies with any finite number of agents and goods. We establish that (i) there is no strategy-proof, Pareto-efficient, and individually rational rule on the class of classical, homothetic, and smooth preferences; and (ii) there is no strategy-proof, Pareto-efficient, and symmetric rule on the same class of preferences. Journal of Economic Literature Classification Numbers: D78, D71, C72.     

Condorcet cycles in bipartite populations

Summary. Simple majority voting between pairs of alternatives is used to aggregate individual preferences. The occurence of Condorcet cycles is limited thanks to a principle of homogeneity on individual preferences. The restrictions induced on the domain of the latters are weak: among the n! possible orderings of n alternatives, more than one half are admissible within a domain. The resulting aggregated preference has then a neglectable probability of showing up cycles. We show moreover that the set of individual preferences can be `naturally' partitioned into two such domains. Received: June 17, 1996; revised version: April 15, 1997     

Majority rule when voters like to win

I analyze symmetric majority rule voting equilibria when voters wish to elect the better candidate and to vote for the winner. When voters care only about the winning candidate (the standard formulation) a unique responsive equilibrium exists. The addition of a desire to win creates multiple equilibria, some with unusual properties. In most of these equilibria information is not aggregated effectively, and I uncover the novel possibility of negative information aggregation in which information aggregated in equilibrium is used to select the worse rather than the better candidate.I then characterize the efficiency of optimal equilibria as the population becomes large and show that a discontinuity arises in the information aggregation capabilities of the majority rule voting mechanism: in elections without a dominant front-running candidate the better candidate is almost surely elected, whereas in races with a front-runner information cannot be effectively aggregated in equilibrium.     

Counterexamples on the Superiority of Approval versus Plurality

We present a simple voting environment with three candidates where the Condorcet winner exists. Under plurality rule, the derived game has a stable set where such a candidate is elected with probability one. However, no stable set of the approval game elects the Condorcet winner with positive probability. We also analyze the robustness of such an example to changes in the number of voters and their preferences. To conclude, we present a generic four‐candidate voting environment with the same properties.     

Maximal Domain of Preferences in the Division Problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, then the uniform allocation rule is the unique strategy-proof, efficient, and anonymous rule. We identify the maximal set of preferences, containing the set of single-peaked preferences, under which there exists at least one rule satisfying the properties of strategy-proofness, efficiency, and strong symmetry. In addition, we show that our characterization implies a slightly weaker version of Ching and Serizawa's (1998) result. Journal of Economic Literature Classification Numbers: D71, D78, D63.     

A leximin characterization of strategy-proof and non-resolute social choice procedures

Summary. 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 individual i such that g(r) is the set of alternatives that are the k highest ranking in i's preference ordering, or (ii) all sets of cardinality 1 to k are chosen and there is a coalition L of cardinality k such that g(r) is the union of the tops for the individuals in L. There do not exist any strategy-proof rules such that the choice sets are all of cardinality to k where . Received: November 8, 1999; revised version: September 18, 2001     

Second-best efficiency of allocation rules: strategy-proofness and single-peaked preferences with multiple commodities

We study strategy-proof allocation rules in economies with perfectly divisible multiple commodities and single-peaked preferences. In this setup, it is known that the incompatibility among strategy-proofness, Pareto efficiency and non-dictatorship arises in contrast with the Sprumont (Econometrica 59:509–519, 1991) one commodity model. We first investigate the existence problem of strategy-proof and second-best efficient rules, where a strategy-proof rule is second-best efficient if it is not Pareto-dominated by any other strategy-proof rules. We show that there exists an egalitarian rational (consequently, non-dictatorial) strategy-proof rule satisfying second-best efficiency. Second, we give a new characterization of the generalized uniform rule with the second-best efficiency in two-agent case.     

Dictatorial domains

Summary. In this paper, we introduce the notion of a linked domain and prove that a non-manipulable social choice function defined on such a domain must be dictatorial. This result not only generalizes the Gibbard-Satterthwaite Theorem but also demonstrates that the equivalence between dictatorship and non-manipulability is far more robust than suggested by that theorem. We provide an application of this result in a particular model of voting. We also provide a necessary condition for a domain to be dictatorial and use it to characterize dictatorial domains in the cases where the number of alternatives is three. Received: July 12, 2000; revised version: March 21, 2002 RID="*" ID="*" The authors would like to thank two anonymous referees for their detailed comments. Correspondence to: A. Sen