Strategy-proof and individually rational social choice functions for public good economies: A note

Summary. Serizawa [3] characterized the set of strategy-proof, individually rational, no exploitative, and non-bossy social choice functions in economies with pure public goods. He left an open question whether non-bossiness is necessary for his characterization. We will prove that non-bossiness is implied by the other three axioms in his characterization. Received: October 17, 1997; revised version: January 19, 1998     

Candidate stability and probabilistic voting procedures

Summary. We extend the analysis of Dutta, Jackson and Le Breton (Econometrica, 2001) on strategic candidacy to probabilistic environments. For each agenda and each profile of voters preferences over running candidates, a probabilistic voting procedure selects a lottery on the set of running candidates. Assuming that candidates cannot vote, we show that random dictatorships are the only unanimous probabilistic voting procedures that never provide unilateral incentives for the candidates to withdraw their candidacy at any set of potential candidates. More flexible probabilistic voting procedures can be devised if we restrict our attention to the stability of specific sets of potential candidates.Received: 4 February 2003, Revised: 14 September 2004, JEL Classification Numbers: D71, D72.This is a revised version of a chapter of my Ph.D. Dissertation submitted to the Universitat Autónoma de Barcelona. I am indebted to my supervisor Salvador Barberá for his advice and constant support. I am grateful to Dolors Berga and an anonymous referee for their detailed comments and suggestions. I thank José Alcalde, Walter Bossert, Bhaskar Dutta, Lars Ehlers, Jordi Massó, Diego Moreno, Clara Ponsatí, Yves Sprumont, and William Thomson for many helpful comments and discussions. I thank the hospitality of the C.R.D.E. at the Université de Montréal and the Department of Economics of the University of Warwick where parts of this research were conducted. Financial support through Research Grant 1998FI00022 from Comissionat per Universitats i Recerca, Generalitat de Catalunya, Research Project PB98-870 from the Ministerio de Ciencia y Tecnología, and Fundación Barrié de la Maza is gratefully acknowledged.     

Approval voting in subset elections

Summary. Approval voting is designed to be “insensitive to numbers” of voters, and likely to elect a Condorcet candidate. However, the result of an election among one group of candidates gives no information about the results of elections among any other groups, even if every voter follows the recommended utility-maximizing strategy, which places strong restrictions on the individual voter's subset ballots. Thus the addition of a single candidate could completely reverse the outcome of an election, or a Condorcet candidate could finish last. Received: November 5, 1998; revised version: November 30, 1998     

Rationalizable variable-population choice functions

Summary. We analyze the rationalizability of variable-population social-choice functions in a welfarist framework. It is shown that fixed-population rationalizability and a weakening of congruence together are necessary and sufficient for rational choice, given a plausible dominance property that prevents the choice of alternatives involving low utility levels. In addition, a class of critical-level separable choice functions is characterized. This result, which extends an earlier axiomatization of a related class of bargaining solutions to a variable-population setting, is the first axiomatization of critical-level principles in a general choice-theoretic model. Received: November 30, 1999; revised version: September 11, 2000     

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     

Non-dictatorial extensive social choice

Summary. Different social planners may have different opinions on the well-being of individuals under different social options (Roberts, 1980). If utilities are translation- or ratio-scale measurable, or if the social ranking might be incomplete, or if interplanner comparability is allowed; then there exist non-dictatorial aggregation rules. We propose extensions, intersections, and mixtures of the Pareto, utilitarian, leximin, Kolm-Pollak, and iso-elastic rules.Received: 16 May 2001, Revised: 18 November 2003, JEL Classification Numbers: D63, D71. Correspondence to: Erwin OogheErwin Ooghe, Luc Lauwers: We are extremely grateful to the referee who was willing to review this paper many times. Her/his extensive and in-depth comments had a strong impact. Further thanks are due to Bart Capéau, Marc Fleurbaey, Maurice Salles, Erik Schokkaert, and Alain Trannoy. The first author gratefully acknowledges the financial support by the TMR network Living Standards, Inequality and Taxation (ERBFMRXCT 980248) of the European Communities.     

A KKM-result and an application for binary and non-binary choice functions

Summary. By generalizing the classical Knaster-Kuratowski-Mazurkiewicz Theorem, we obtain a result that provides sufficient conditions to ensure the non-emptiness of several kinds of choice functions. This result generalizes well-known results on the existence of maximal elements for binary relations (Bergstrom [4]; Walker [16]; Tian [15]), on the non-emptiness of non-binary choice functions (Nehring [12]; Llinares and Sánchez [9]) and on the non-emptiness of some classical solutions for tournaments (top cycle and uncovered set) on non-finite sets. Received: December 29, 1999; revised version: October 18, 2001     

Theorems on correspondences and stability of the core

In this note two theorems strengthening Grodal's (1971) Theorem on correspondences are proved. The first drops the convexity assumption. The second strengthens that theorem further for the case when the range is the positive orthant. In this case, the conclusion of Grodal's Theorem - the intersection of the integral with the interior of the range being open- is modified to read as the integral being a relative open subset of the positive orthant. An example is provided to show that, such a strengthening is not valid in general. This allows us to dispense with the requirment of convexity of preferences in Grodal's (1971) theorems on the closedness of the set of Pareto optimal allocations, the core, and the continuity of the core correspondence for pure exchange economies. We apply this result to show that blocking coalitions in a large economy are stable. Received: September 30, 1998; revised version: September 18, 2001 RID="*" ID="*" The author is grateful to an anonymous referee for helpful comments. The usual disclaimer applies.     

Geometry and impossibility

Summary. This note presents a simple proof of Arrow's impossibility theorem using Saari's [3, 4] “geometry of voting”. Received: March 5, 2001; revised version: August 16, 2001     

Revealed group preferences on non-convex choice problems

Summary. This paper studies the conditions under which the basic results of the revealed preference theory can be established on the domain of choice problems which include non-convex feasible sets; the exercise is closely related to the works of Peters and Wakker (1991) and Bossert (1994). We show that while no continuous choice function can satisfy strong Pareto optimality over the class of all compact and comprehensive choice problems, strong Pareto optimality, Arrow's choice axiom, upper hemicontinuity and a weak compromisation postulate turn out to be necessary and sufficient to represent choice correspondences by continuous, strictly increasing and quasiconcave real-valued functions. Some applications of our main findings to axiomatic bargaining theory are also studied. Received: December 2, 1996; revised version: February 27, 1998     

Purification of incentive compatible allocations

In implementation theory it is common to consider social choice functions that map to lotteries over outcomes. For example, virtual implementation has been used widely with social choice functions that involve randomization. This paper investigates (in incomplete information environments) the possibility of purification of such social choice functions, where purification means that the “replacement” social choice function maps to outcomes rather than distributions over outcomes, is incentive compatible and generates the same distribution over payoffs and outcomes as the original social choice function. Received: July 31, 2000; revised version: December 2, 2002 RID="*" ID="*" Thanks are due to Ole Nielsen, Terence Tao and Lin Zhou for helpful conversations. Thanks are also due to an anonymous referee for detailed comments.     

Scoring run-off paradoxes for variable electorates

   Summary. A no-show paradox occurs each time a single voter or a group of voters can manipulate the outcome by not participating to the election process. Among other voting procedures, the scoring run-off methods, which eliminate progressively the alternatives on the basis of scoring rules, suffer from this flaw. We here estimate how frequent this paradox is for three candidate elections under the classical Impartial Culture and Impartial Anonymous Culture assumptions, for different population sizes. The conditions under which this paradox occurs are also described, as well as the relationships with manipulations for a fixed number of voters. Received: October 21, 1999; revised version: January 12, 2000     

The likelihood of dubious election outcomes

Summary. A disturbing phenomenon in voting, which causes most of the problems as well as the interest in the field, is that election outcomes (for fixed preferences) can change with the way the ballots are tallied. This causes difficulties because with each possible choice, some set of voters can be dubious about whether it is the “correct” one. But, how likely are these settings allowing multiple election outcomes? By combining properties of the geometry of voting developed by Saari with a analytic-geometric technique created by Schlafli, we determine the likelihood that a three candidate election can cause these potentially dubious outcomes. Received: April 11, 1997; revised version: November 12, 1997     

On the inconsistent behavior in voting for incumbents and for term limitation

This paper considers the seemingly inconsistent behavior of individuals who simultaneously vote for incumbents and for limitations on their terms in office. We argue that such behavior may occur even if voters pursue their self-interests in both candidate and term-limitation elections. First, we formulate elections for Congressional candidates as a two-person game, where each candidate maximizes votes by proposing a distribution of benefits to voters. Then we discuss the term limitation at the state level, where voters in each district compare, over time, the average benefits obtained from two alternative series of campaign games: one with a longer tenure associated with no term limit and the other with a shorter tenure created by the introduction of a term limit. In elections of candidates for Congress, the incumbent is successful because he can generate more aggregate benefits for voters. We show, however, that at some critical point of the tenure, his behavior will be less beneficial to his core constituents. In term-limitation elections, those voters tend to support a term limit. In some cases, they represent a majority in the state, and term limits are enacted. Received: February 23, 1999; revised version: January 24, 2000     

A comparison of Dodgson's method and the Borda count

Summary. In an election without a Condorcet winner, Dodgson's Method is designed to find the candidate that is “closest” to being a Condorcet winner. In this paper, we show that the winner from Dodgson's Method can occur at any position in the ranking obtained from the Borda Count, the plurality method, or any other positional voting procedure. In addition, we demonstrate that Dodgson's Method does not satisfy the Independence of Irrelevant Alternatives axiom. Received: January 12, 2001; revised version: June 7, 2001     

Delegation and polarization of platforms in political competition

Summary. We consider a model of political competition among two ideological parties who are uncertain about the distribution of voters. The distinguishing feature of the model is that parties can delegate electoral decisions to candidates by nomination. It is shown that if the credible platform commitments of the candidates is feasible, then at least one of the parties nominates in equilibrium to a candidate who has an ideology that is more radical than the delegating party's ideology. In a variety of circumstances, this, in turn, yields a polarization of equilibrium policy choices of the candidates. It is thus argued formally here that strategic nomination of the candidates may well be one of the major reasons behind the well documented observation that the platforms associated with the political parties in two-party democracies are often surprisingly polarized. Received: January 10, 2002; revised version: May 8, 2002 RID="*" ID="*" We thank Alberto Alesina, Levent Ko?kesen, Antonio Merlo, Ronny Razin, Vijay Krishna, Alessandro Lizzeri, and seminar participants at Alicante, Columbia, Copenhagen, and NYU for helpful comments. We also thank an anonymous referee for its useful suggestions. A good fraction of this research was conducted while Ok was a visitor in the Department of Economics at University of Alicante; he thanks for the kind hospitality of this institution. We gratefully acknowledge the financial support from the Spanish Ministry of Education through grant CICYT BEC2001-0535 (Faulí-Oller) and BEC2001-0980 (Ortu?o-Ortín). Correspondence to:I. Ortu?o-Ortin     

On coalitional stability of anonymous interim mechanisms

Summary.   In a situation where agents have private information, we investigate the stability of mechanisms with respect to coalitional deviations. In the cooperative tradition, we first extend the notion of Core, taking into account the information a coalition may have when it forms and the conjectures of outsiders. This leads us to propose a family of Cores rather than a single one. Secondly, we study the stability of Core mechanisms to secession proposals in simple noncooperative games. The two different stability analyses, normative and strategic, tend to give support to the more natural extension of the Core, called Statistical Core, only in situations where some strong form of increasing returns to coalition is met. Without this property, arguments for a concept of Core that is non empty in a reasonably large class of problems are less compelling. Applications to taxation and insurance are given. Received: September 6, 1999; revised version: December 3, 1999     

Optimal collective dichotomous choice under quota constraints

Summary. This paper presents optimal collective dichotomous choices under quota constraints. We focus on committees that have to decide whether to accept or reject a set of projects under quota constraints. We provide a method for optimal ranking of projects which is suitable for solving this problem. The main result generalizes a number of earlier results in the subject. To outline the applicability of our method, we demonstrate its usage in the area of information filtering. Received: February 14, 2000; revised version: January 19, 2001     

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     

Endogenous technological change: a note on stability

Summary. This paper demonstrates that the steady-state solution of the optimal-growth problem in Romer's (1990) model of endogenous technological change is globally saddle-point stable. Surprisingly, the proof of this result is trivial. Interest in the optimal growth path is justified by the fact that there is a (unique) combination of production and R&D subsidies by means of which the optimal growth path is attained as a market equilibrium. Received: October 6, 1998; revised version: April 19, 1999