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     

Serial cost sharing of excludable public goods: general cost functions

Summary. A group of individuals meet to share the cost and determine output allocations of a partial-excludable public good. We demonstrate that, for general cost functions and preferences that satisfy the Spence-Mirlees sorting condition, the serial cost-sharing formula (Moulin, 1994) has remarkable incentive properties. First, a direct economic mechanism that uses the serial formula is coalition strategy-proof, envy-free and satisfies the stand-alone property. Second, the serial mechanism involves partial exclusion, which is important for the reduction of the free-rider problem. Received: June 10, 1996; revised version; February 11, 1997     

Asymmetric information, strategic behavior, and discrimination in the labor market

Summary  The neoclassical model of labor market discrimination assumes the presence of either prejudiced preferences, biased assessments of worker productivity, or monopsony power. We show that when market agents control asymmetric information, strategic behavior can induce discriminatory hiring practices even when these market features are absent. Moreover, strategic interaction many distort public policies to the point of harming the segments of the work force they were designed to support. Received: January 3, 1996 revised version April 29, 1996     

Contest success functions: an extension

Summary. This note extends the axiomatic characterization of the power success function in fair contests by Skaperdas (1996) to an unfair contest. We show that the results previously obtained are straightforward to generalize; the success function is uniquely characterized by Luces Choice Axiom (implying independence of irrelevant alternatives) and homogeneity of degree zero.Received: July 1, 1996; revised version: October 30, 1996This revised version was published online in February 2005 with corrections to the cover date.     

Cooperative games in permutational structure

Summary. By a cooperative game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a set of payoffs for each coalition being a nonempty subset of the grand coalition of all players. It is well-known that balancedness is a sufficient condition for the nonemptiness of the core of such a cooperative non-transferable utility game. In this paper we consider non-transferable utility games in which for any coalition the set of payoffs depends on a permutation or ordering upon any partition of the coalition into subcoalitions. We call such a game a cooperative game in permutational structure or shortly permutational game. Doing so we extend the scope of the standard cooperative game theory in dealing with economic or political problems. Next we define the concept of core for such games. By introducing balancedness for ordered partitions of coalitions, we prove the nonemptiness of the core of a balanced non-transferable utility permutational game. Moreover we show that the core of a permutational game coincides with the core of an induced game in coalitional structure, but that balancedness of the permutational game need not imply balancedness of the corresponding coalitional game. This leads to a weakening of the conditions for the existence of a nonempty core of a game in coalitional structure, induced by a game in permutational structure. Furthermore, we refine the concept of core for the class of permutational games. We call this refinement the balanced-core of the game and show that the balanced-core of a balanced permutational game is a nonempty subset of the core. The proof of the nonemptiness of the core of a permutational game is based on a new intersection theorem on the unit simplex, which generalizes the well-known intersection theorem of Shapley. Received: October 31, 1995; revised version: February 5, 1997     

A resolution of N-person prisoners' dilemma

Summary. The purpose of this paper is to show that cooperation is possible in N-person prisoners' dilemma if players have incomplete information on the order of their moves. We consider a modified version of N-person prisoners' dilemma in which players sequentially move in the order determined by Nature, and during the play they get some information about others. We provide an information partition and a condition of payoffs for which cooperation is attained in an equilibrium. Further, for the case that full cooperation is not attained, we examine the largest partial cooperation which is achieved in an equilibrium. Received: March 5, 1995; revised version August 11, 1996     

Competition between asymmetrically informed principals

Summary. This paper derives the set of equilibria for common agency games in which the principals compete in piece rates and lump sum payments and one principal has incomplete information about the agent's preferences. We show that the uninformed principal's expected payoff function is discontinuous with respect to the identity of the marginal agent type. This discontinuity is shown to support an open set of equilibria. For games in which the first-best equilibrium strategies are measurable with respect to the uninformed principal's information partition, this result implies the existence of an open set of Pareto inefficient equilibria. Received: December 5, 1995; revised version August 18, 1996     

Sealed bid auctions with uncertainty averse bidders

Summary. Traditional analysis of auctions assumes that each bidder's beliefs about opponents' valuations are represented by a probability measure. Motivated by experimental findings such as the Ellsberg Paradox, this paper examines the consequences of relaxing this assumption in the first and second price sealed bid auctions with independent private values. The multiple priors model of Gilboa and Schmeidler [Journal of Mathematical Economics, 18 (1989), 141–153] is adopted specifically to represent the bidders' (and the auctioneer's) preferences. The unique equilibrium bidding strategy in the first price auction is derived. Moreover, under an interesting parametric specialization of the model, it is shown that the first price auction Pareto dominates the second price auction. Received: December 15, 1995; revised version: February 19, 1997     

Reallocation of an infinitely divisible good

Summary. We consider the problem of reallocating the total initial endowments of an infinitely divisible commodity among agents with single-peaked preferences. With the uniform reallocation rule we propose a solution which satisfies many appealing properties, describing the effect of population and endowment variations on the outcome. The central properties which are studied in this context are population monotonicity, bilateral consistency, (endowment) monotonicity and (endowment) strategy-proofness. Furthermore, the uniform reallocation rule is Pareto optimal and satisfies several equity conditions, e.g., equal-treatment and envy-freeness. We study the trade-off between properties concerning variation and properties concerning equity. Furthermore, we provide several characterizations of the uniform reallocation rule based on these properties. Received: August 29, 1995; revised version June 26, 1996     

The geometry of inductive reasoning in games

Summary.  This paper contributes to the recent focus on dynamics in noncooperative games when players use inductive learning. The most well-known inductive learning rule, Brown’s fictitious play, is known to converge for games, yet many examples exist where fictitious play reasoning fails to converge to a Nash equilibrium. Building on ideas from chaotic dynamics, this paper develops a geometric conceptualization of instability in games, allowing for a reinterpretation of existing results and suggesting avenues for new results. Received: October 27, 1995 revised version May 2, 1996     

Adaptive learning in extensive form games and sequential equilibrium

Summary. This paper studies adaptive learning in extensive form games and provides conditions for convergence points of adaptive learning to be sequential equilibria. Precisely, we present a set of conditions on learning sequences such that an assessment is a sequential equilibrium if and only if there is a learning sequence fulfilling the conditions, which leads to the assessment. Received: November 5, 1996; revised version: May 28, 1997     

Contract renegotiation in a continuous state space

Summary. When players are unable to write complete state contingent contracts it is shown, within the context of a non-cooperative contracting-renegotiation game, that the only subgame perfect equilibrium allocations are those that correspond to the set of first-best allocations. Players are able to implement this set of allocations by signing an initial contract that is subsequently renegotiated in all states of the world. The contracting-renegotiation problem is complicated in an interesting way by assuming that the state space is continuous. The issue of the existence of an initial contract, that is subsequently renegotiated to the set of first-best allocations, must be resolved. Unlike Aghion, Dewatripont and Rey [1994], the results here do not require nor depend upon the comonotonicity of the objective functions. Received: January 27, 1995; revised version July 1, 1996     

An extremely simple proof of the K-K-M-S Theorem

Summary.  An extremely simple proof of the K-K-M-S Theorem is given involving only Brouwer’s fixed point theorem and some elementary calculus. A function is explicitly given such that a fixed point of it yields an intersection point of a balanced collection of sets together with balancing weights. Moreover, any intersection point of a balanced collection of sets together with balancing weights corresponds to a fixed point of the function. Furthermore, the proof can be used to show -balanced versions of the K-K-M-S Theorem, with -balancedness as introduced in Billera (1970). The proof makes clear that the conditions made with respect to by Billera can be even weakened. Received: January 22, 1996; revised version June 9, 1996     

A comparison between the core and the monopoly solutions in a mixed exchange economy

Summary. Using a mixed market model for analyzing imperfectly competitive economies, we maximize the oligopolists' Welfare Function, given individual rationality and feasibility constraints. We prove that solutions belong to the core for a large class of economies. This class includes, in particular, every monopoly having a single type of small traders. Note that all such solutions yield the large trader, utility-wise, strictly more than at any monopoly solution, where the monopolist plays strategically, and the ocean of small traders act as being as price-takers. Received: March 4, 1996; revised version July 7, 1996     

Multi-unit auctions with uniform prices

Summary. Auctions in which individuals can purchase more than one unit of the good being sold differ in striking ways from multi-unit auctions in which individuals may purchase only one unit. The uniform price auction in particular frequently yields Nash equilibria in which bidders underbid for their second unit and therefore pay very low prices for the good. This paper characterizes equilibria for the uniform price auction. Received: July 31, 1995; revised version: May 28, 1997     

Elastic demand, sunk costs and the Kreps–Scheinkman extension of the Cournot model

Summary. The paper shows that, with any rationing mechanism between the efficient and proportional extremes, the Kreps-Scheinkman two-stage quantity-price game reduces to the Cournot model if demand is uniformly elastic and if all costs are sunk at the first stage, thus providing positive results to set against existing negative statements. Received: May 24, 1995; revised version: March 6, 1997     

Quasitransitive social preference: why some very large coalitions have very little power

Summary. 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). Received: August 29, 1996; revised version: March 24, 1997     

Coalitional bargaining games with random proposers: Theory and application

We consider a non-cooperative coalitional bargaining game with random proposers in a general situation for which players differ in recognition probability and time preference. We characterize an efficient equilibrium as the generalized Nash bargaining solution that belongs to the core. The model is applied to wage bargaining between an employer and multiple workers. Although involuntary unemployment may occur in equilibrium, full employment emerges as players become sufficiently patient.     

Sequential equilibria of asymmetric ascending auctions: The case of log-normal distributions

Summary. The sequential equilibrium of an ascending-price auction of a single item is derived explicitly for the case of log-normal distributions and a multiplicative valuation model comprising both common and private factors, and allowing asymmetries. If the prior distribution on the common factors is diffuse, or of the form obtained by Bayesian updating from a diffuse prior distribution, then the equilibrium strategies are log-linear with coefficients obtained by solving a set of linear equations. A similar construction applies to normal distributions and additive terms in the valuation model. An example illustrates the predictions derived from the model. Received: December 11, 1996; revised version: July 15, 1997