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     

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     

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     

The set of sunspot equilibria in economies with incomplete financial markets: variable asset prices

Summary. I consider the set of equilibria of two-period economies with S extrinsic states of nature in the second period and I assets with linearly independent nominal payoffs. Asset prices are variable. If the number of agents is greater than (S-I), the payoff matrix is in general position and S 2I, the set of equilibrium allocations generically (in utility function space) contains a smooth manifold of dimension (S-1). Moreover, the map from states o f nature to equilibrium allocations (restricted to this manifold) is one-to-one at each equilibrium. Received: February 23, 1998; revised version: June 1, 2000     

How many voters are needed for paradoxes?

Summary. This paper presents a general procedure for finding profiles with the minimum number of voters required for many important paradoxes. Borda's and Condorcet's classic examples are revisited as well as generalizations. Using Saari's procedure line, we obtain an upper bound for the minimum number of voters needed for a profile for which the Condorcet winner is not strictly top ranked for all weighted positional procedures. Also we give a simple upper bound on the minimum number of voters needed for a set of prescribed voting outcomes. In contrast to situations wherein small numbers of voters are needed, we consider paradoxes requiring arbitrarily large numbers of voters as well as large numbers of alternatives. Finally we indicate connections with statistical rank based tests. Received: April 18, 2001; revised version: May 25, 2001     

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     

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     

Preference profiles sustaining Arrow's theorem

Summary. Arrow's theorem is proved on a domain consisting of two types of preference profiles. Those in the first type are “almost unanimous": for every profile some alternative x is such that the preferences of any two individuals merely differ in the ranking of x, which is in one of the first three positions. Profiles of the second type are “appropriately heterogeneous”, with preferences similar to those generating the “paradox of voting”. Received: March 9, 2000; revised version: June 7, 2001     

Rationalizability and the savage axioms

Summary. Suppose there is a finite set of acts defined on a finite state space and a decision maker chooses an act from the set. In this setting, the subjective expected utility model is observationally indistinguishable from all models of preference that satisfy Savage's axiom P3. The result has implications also for rationalizability in strategic games. Received: September 18, 1998; revised version: January 29, 1999     

The multiple unit auction with variable supply

Summary. The theory of multiple unit auctions traditionally assumes that the offered quantity is fixed. I argue that this assumption is not appropriate for many applications because the seller may be able and willing to adjust the supply as a function of the bidding. In this paper I address this shortcoming by analyzing a multi-unit auction game between a monopolistic seller who can produce arbitrary quantities at constant unit cost, and oligopolistic bidders. I establish the existence of a subgame-perfect equilibrium for price discriminating and for uniform price auctions. I also show that bidders have an incentive to misreport their true demand in both auction formats, but they do that in different ways and for different reasons. Furthermore, both auction formats are inefficient, but there is no unambiguous ordering among them. Finally, the more competitive the bidders are, the more likely the seller is to prefer uniform pricing over price discrimination, yet increased competition among bidders may or may not enhance efficiency. Received: June 18, 1998; revised version: January 13, 1999     

Candidate stability and nonbinary social choice

Summary. The requirement that a voting procedure be immune to the strategic withdrawal of a candidate for election can be formalized in different ways. Dutta, Jackson, and Le Breton (Econometrica, 2001) have recently shown that two formalizations of this candidate stability property are incompatible with some other desirable properties of voting procedures. This article shows that Grether and Plott's nonbinary generalization of Arrow's Theorem can be used to provide simple proofs of two of their impossibility theorems. Received: August 15, 2001; revised version: March 11, 2002 RID="*" ID="*" Parts of this article were previously circulated in somewhat different form in a working paper with the same title by the second author. We are grateful to Michel Le Breton and an anonymous referee for their comments. Correspondence to:J.A. Weymark     

Unsettling aspects of voting theory

Summary. Voting procedures are known to be plagued with a variety of difficulties such as strategic voting, or where a voter is rewarded with a better election outcome by not voting, or where a winning candidate can lose by receiving more support. Once we know that these problems can occur, the next objective should be to completely understand how, why, and where they arise. Namely, for each election procedure, the new goal is to determine when such problems can occur, all voter types who can cause these difficulties, and the actions they must take. This paper develops an easily used approach to handle all of these issues for standard voting methods. New intuitive explanations for these various oddities follow from this approach. Received: August 14, 2002 ; revised version: September 4, 2002 RID="*" ID="*"My thanks to Richard Barrett and, in particular, to Hannu Nurmi for corrections, several useful comments, and suggestions they made about earlier versions. Also, my thanks to a referee for calling some excellent references to my attention. An earlier draft was presented at the 2002 Public Choice Society meeting. This research was supported by an NSF grant.     

Approximation by finite horizons of the undiscounted one-sector growth model

Summary. In this paper I give a method for finding long-run-average policies in the undiscounted economic growth problem using approximations by finite horizons. Required hypothesis is the strong interiority of T-horizon solutions. Received: March 25, 1996; revised version: July 29, 1997     

The probability of conflicts in a U.S. presidential type election

Summary. In a two candidate election, it might be that a candidate wins in a majority of districts while he gets less vote than his opponent in the whole country. In Social Choice Theory, this situation is known as the compound majority paradox, or the referendum paradox. Although occurrences of such paradoxical results have been observed worldwide in political elections (e.g. United States, United Kingdom, France), no study evaluates theoretically the likelihood of such situations. In this paper, we propose four probability models in order to tackle this issue, for the case where each district has the same population. For a divided electorate, our results prove that the likelihood of this paradox rapidly tends to 20% when the number of districts increases. This probability decreases with the number of states when a candidate receives significatively more vote than his opponent over the whole country.Received: 12 August 2002, Revised: 7 March 2003, JEL Classification Numbers: D71. Correspondence to: Vincent R. MerlinSpecial thanks are due to Franck Bisson, a Caen PhD student, who helped collect the data. The authors also gratefully acknowledge Ashley Piggins and an anonymous referee for their comments.     

A simple axiomatization and constructive representation proof for choquet expected utility

>P>Summary. We provide a set of simple and intuitive set of axioms that allow for a direct and constructive proof of the Choquet Expected Utility representation for decision making under uncertainty. Received: October 29, 2002; revised version: November 13, 2002 RID="*" ID="*" We thank Matthew Ryan for very useful comments and suggestions on related work and for encouraging us to write this note. Correspondence to: S. Grant     

Utility and entropy

Summary. In this paper we study an astonishing similarity between the utility representation problem in economics and the entropy representation problem in thermodynamics. Received: May 17, 1999; revised version: October 16, 2000     

The equivalence of the Dekel–Fudenberg iterative procedure and weakly perfect rationalizability

Summary. Two approaches have been proposed in the literature to refine the rationalizability solution concept: either assuming that a player believes that with small probability her opponents choose strategies that are irrational, or assuming that their is a small amount of payoff uncertainty. We show that both approaches lead to the same refinement if strategy perturbations are made according to the concept of weakly perfect rationalizability, and if there is payoff uncertainty as in Dekel and Fudenberg [J. of Econ. Theory 52 (1990), 243–267]. For both cases, the strategies that survive are obtained by starting with one round of elimination of weakly dominated strategies followed by many rounds of elimination of strictly dominated strategies. Received: 10 December 1998; revised version: 26 April 1999     

Alternating-offer bargaining over menus under incomplete information

Summary. This paper considers bargaining with one-sided private information and alternating offers where an agreement specifies both a transfer and an additional (sorting) variable. Moreover, both sides can propose menus. We show that for a subset of parameters the alternating-offer game has a unique equilibrium where efficient contracts are implemented in the first period. This stands in sharp contrast to the benchmarks of contract theory, where typically only the uninformed side proposes, and bargaining theory, where typically the agreement only specifies a transfer. Received: September 10, 2001; revised version: March 25, 2002 RID="*" ID="*" I benefitted from discussions with Benny Moldovanu, Holger Müller, and Roland Strausz, and from comments made by an anonymous referee.     

Comparing competition and collusion: a numerical approach

Summary. Collusion is a serious problem in many procurement auctions. In this research, I study a model of first price sealed bid procurement auctions with asymmetric bidders. I demonstrate that the equilibrium to the model is unique and describe three algorithms that can be used to compute the inverse equilibrium bid functions. I then use the computational algorithms to compare competitive and collusive bidding. The algorithms are useful for structural estimation of auction models and for assessing the damages from bid-rigging. Received: January 14, 2000; revised version: February 28, 2001     

On Lipschitz continuity of policy functions in continuous-time optimal growth models

Summary. This paper proves the C ^1,1 differentiability of the value function for continuous time concave dynamic optimization problems, under the assumption that the instantaneous utility is C ^1,1 and the initial segment of optimal solutions is interior. From this result, the Lipschitz dependence of optimal solutions on initial data and the Lipschitz continuity of the policy function are derived, by adding an assumption of strong concavity of the integrand. Received: July 29, 1996; revised version: November 25, 1997