An admissible set occurring in various bargaining situations

Given a set of alternatives S and a binary relation M on S the admissible set of the pair (S, M) is defined to be the set of maximal elements with respect to the transitive closure of M. It is shown that existing solutions in game theory and mathematical economics are special cases of this concept (they are admissible sets of a natural S and M). These include the core of an n-person cooperative game, Nash equilibria of a noncooperative game, and the max-min solution of a two-person zero sum game. The competitive equilibrium prices of a finite exchange economy are always contained in its admissible set. Special general properties of the admissible set are discussed. These include existence, stability, and a stochastic dynamic process which leads to outcomes in the admissible set with high probability.     

Characterization of the existence of maximal elements of acyclic relations

Summary. We obtain a sufficient condition for the existence of maximal elements of irreflexive binary relations that generalizes the theorem of Bergstrom and Walker by relaxing the compactness condition to a weaker one that is naturally related to the relation. We then prove that the sufficient conditions used both in the Bergstrom-Walker Theorem and in our generalization provide a characterization of the existence of maximal elements of acyclic binary relations. Other sufficient conditions for the existence of maximal elements obtained by Mehta, by Peris and Subiza and by Campbell and Walker are shown to be necessary too. Received: May 28, 1997; revised version: October 5, 2000     

Minimal conditions for upper-hemicontinuity of the choice correspondence

We denote by ?(M, r) the set of all maximal elements in the constraint set M with respect to a (partial) order r and find the coarsest topologies on the domain of ? such that ? is u.h.c.     

Moral hazard with bounded payments

We study the moral hazard problem with general upper and lower constraints M on compensation. We characterize the optimal contract and show existence and uniqueness. When minimizing costs for given effort, a principal harmed by M will pay according to M on some range of outcomes; when M reflects limited liability or a minimum wage, the contract is option-like. When the principal also chooses effort, a principal harmed by M might nonetheless never pay according to M. This cannot occur if the cost of inducing effort in the standard principal-agent problem is convex, for which we provide sufficient conditions related to the informativeness of outcome about effort.     

Size approval voting

We propose a new class of voting procedures, called Size Approval Voting, according to which, the effective weight of a vote from a given individual depends on how many other candidates that individual votes for. In particular, weights are assumed to be non-negative and weakly decreasing in the number of approved candidates. Then, for a given profile of individual votes, all candidates with the maximal sum of weighted votes are elected. We show in our axiomatic analysis that the family of all Size Approval Voting procedures is characterized by a set of natural properties.     

Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly

The seller of N distinct objects is uncertain about the buyer's valuation for those objects. The seller's problem, to maximize expected revenue, consists of maximizing a linear functional over a convex set of mechanisms. A solution to the seller's problem can always be found in an extreme point of the feasible set. We identify the relevant extreme points and faces of the feasible set. We provide a simple algebraic procedure to determine whether a mechanism is an extreme point. We characterize the mechanisms that maximize revenue for some well-behaved distribution of buyer's valuations.     

Choosing the two finalists

This paper studies a decision maker who for each choice set selects a subset of (at most) two alternatives. We axiomatize three types of procedures: (i) The top two: the decision maker has in mind an ordering and chooses the two maximal alternatives. (ii) The two extremes: the decision maker has in mind an ordering and chooses the maximal and the minimal alternatives. (iii) The top and the top: the decision maker has in mind two orderings and he chooses the maximal element from each.     

Rationalizable implementation

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict version of the monotonicity condition introduced by Maskin is necessary under the solution concept of rationalizability. Assuming the social choice function is responsive, i.e. in distinct states it selects distinct outcomes, we show that strict Maskin monotonicity is also sufficient under a mild “no worst alternative” condition. In particular, no economic condition is required. We discuss how our results extend when the social choice function is not responsive.     

Efficiency First or Equity First? Two Principles and Rationality of Social Choice

This paper formalizes two different principles to socially rank allocations under efficiency-equity trade off. The efficiency-first social preference relation ranks an allocation x higher than an allocation y if and only if (i) x is Pareto-superior to y or (ii) x and y are Pareto-noncomparable and x is equity-superior to y. The equity-first social preference relation reverses the order of application of the two criteria. We show that the efficiency-first relation may have a cycle, whereas the equity-first relation is transitive. We also characterize and compare the sets of maximal elements for these social preference relations in the Edgeworth box and examine the nonemptiness of the sets. Journal of Economic Literature Classification Numbers: D71, D63, D61.     

Ordinal Bivariate Inequality: Concepts and Application to Child Deprivation in Mozambique

This paper introduces a concept of inequality comparisons with ordinal bivariate categorical data. In our model, one population is more unequal than another when they have common arithmetic median outcomes and the first can be obtained from the second by correlation‐increasing switches and/or median‐preserving spreads. For the canonical 2 × 2 case (with two binary indicators), we derive a simple operational procedure for checking ordinal inequality relations in practice. As an illustration, we apply the model to childhood deprivation in Mozambique.     

Unmediated communication in games with complete and incomplete information

We study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^U(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available and players exchange private or public messages that do not affect directly their payoffs. We first show that if G is a game of complete information with five or more players and rational parameters, then S^U(G) coincides with the set of correlated equilibria of G. Next, we demonstrate that if G is a game of incomplete information with at least five players, rational parameters and full support (i.e., all profiles of types have positive probability), then S^U(G) is equal to the set of communication equilibria of G.     

Voting by Successive Elimination and Strategic Candidacy

We study the impact of strategic choices of self-interested candidates of whether or not to enter an election. We focus on strategic candidacy in the context of the tree and binary voting procedures used by small groups such as committees. We offer a comprehensive analysis for the special but important case of voting by successive elimination. Strategic candidacy slightly enlarges the set of candidates that can be equilibrium outcomes relative to the traditional analysis which takes the set of candidates as fixed. Pareto-dominated candidates can be elected in equilibrium under voting by successive elimination when strategic candidacy is considered, in contrast with a fixed set of candidates. Journal of Economic Litterature Classification Numbers: D71, D72.     

Implementing quotas in university admissions: An experimental analysis

This paper studies the implementation of quotas in matching markets. In a controlled laboratory environment, we compare the performance of two university admissions procedures that both initially reserve a significant fraction of seats at each university for a special subgroup of students. The first mechanism mimics the sequential procedure currently used by the central clearinghouse for university admissions in Germany. This procedure starts by allocating reserved seats among eligible students and then allocates all remaining seats among those who were not already assigned one of the reserved seats in the first part of the procedure. The second mechanism is based on a modified student-proposing deferred acceptance algorithm in which all seats are allocated simultaneously. In theory, the two mechanisms should lead to similar outcomes. Our experimental results, however, suggest that, relative to the sequential procedure, the simultaneous mechanism significantly improves the match outcomes for the beneficiaries of reserved seats.     

Priorities in the location of multiple public facilities

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize the class of rules satisfying Pareto-efficiency, object-population monotonicity and sovereignty. Each rule in the class is a priority rule that selects locations according to a predetermined priority ordering among “interest groups”. We characterize the subclasses of priority rules that respectively satisfy anonymity, avoid the no-show paradox, strategy-proofness and population-monotonicity. In particular, we prove that a priority rule is strategy-proof if and only if it partitions the set of agents into a fixed hierarchy. Any such rule can also be viewed as a collection of generalized peak-selection median rules, that are linked across populations, in a way that we describe.     

Collective choice under dichotomous preferences

Agents partition deterministic outcomes into good or bad. A mechanism selects a lottery over outcomes (time-shares). The probability of a good outcome is the canonical utility. The utilitarian mechanism averages over outcomes with largest “approval”. It is efficient, strategyproof, anonymous and neutral.We reach an impossibility if, in addition, each agent's utility is at least , where n is the number of agents; or is at least the fraction of good to feasible outcomes. We conjecture that no ex ante efficient and strategyproof mechanism guarantees a strictly positive utility to all agents, and prove a weaker statement.     

Strategic candidacy for multivalued voting procedures

Dutta et al. (Econometrica 69 (2001) 1013) (Dutta, Jackson, and Le Breton—DJLeB) initiate the study of manipulation of voting procedures by a candidate who withdraws from the election. A voting procedure is candidate stable if this is never possible. We extend the DJLeB framework by allowing: (a) the outcome of the procedure to be a set of candidates; (b) some or all of the voters to have weak preference orderings of the candidates. When there are at least three candidates, any strongly candidate stable voting selection satisfying a weak unanimity condition is characterized by a serial dictatorship. This result generalizes Theorem 4 of DJLeB.     

Strong maximals: Elements with maximal score in partial orders

It is usually assumed that maximal elements are the best option for an agent. But there are situations in which we can observe that maximal elements are different one from another. This is the case of partial orders, in which one maximal element can be strictly preferred to almost every other element, whereas another maximal is not strictly preferred to any element. As partial orders are an important tool for modelling human behavior, it is interesting to find, for this kind of binary relation, those maximal elements that could be considered the best ones. In so doing, we define a selection inside the maximal set, which we call strong maximals (elements with maximal score), which is proved to be appropriate for choosing among maximals in a partial order.JEL Classification: D11Acknowledgments: Financial support from the Spanish DGICYT-Feder, under project BEC2001-0781, from Fundación Séneca (PI74/00826/FS/01), Generalitat Valenciana (CTDIB2002/314) and from the IVIE, is acknowledged. The comments of the referees improved the work. We thank M. C. Sánchez and J. V. Llinares for several comments and suggestions.     

Universality of Nash components

We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game—a game where all players have two pure strategies and a common utility function with values either zero or one—whose success set (the set of strategy profiles where the maximal payoff of one is indeed achieved) is homeomorphic to the given polyhedral set. Since compact semi-algebraic sets can be triangulated, a similar result follows for the collection of connected compact semi-algebraic sets.We discuss implications of our results for the strategic stability of success sets, and use the results to construct a Nash component with index k for any fixed integer k.     

Pareto-optimal Nash equilibria are competitive in a repeated economy

Consider a finite exchange economy first as a static, 1 period, economy and then as a repeated economy over T periods when the utility of each agent is the mean utility over T. A family of strategic games is defined via a set of six general properties the most distinct of which is the ability of agents to move commodities forward in time. Now consider Pareto optimal allocations in the T period economy which are also Nash equilibria in this family of strategic games. We prove that as T becomes large this set converges to the set of competitive utility allocations in the one period economy. The key idea is that a repetition of the economy when agents can move commodities forward in the time acts as a convexification of the set of individually feasible outcomes for player i holding all other strategies fixed.     

Agreeable bets with multiple priors

This paper considers a two-agent model of trade with multiple priors. Firstly, we characterize the existence of an agreeable bet on some event in terms of the set of priors. It is then shown that the existence of an agreeable bet on some event is a strictly stronger condition than the existence of an agreeable trade, whereas the two conditions are equivalent in the standard Bayesian framework. Secondly, we show that the two conditions are equivalent when the set of priors is the core of a convex capacity. These results are also related to the no trade theorems under asymmetric information.