Informational limitations of ascending combinatorial auctions

We study the inherent limitations of natural widely-used classes of ascending combinatorial auctions. Specifically, we show that ascending combinatorial auctions that do not use both non-linear prices and personalized prices cannot achieve social efficiency with general bidder valuations. We also show that the loss of efficiency can be severe and that only a diminishing fraction of the social welfare may be captured. This justifies the added complexity in the auctions suggested by, e.g., Parkes and Ungar (2000) [29] and Ausubel and Milgrom (2002) [2].     

Substitutes and stability for matching with contracts

We consider the matching with contracts framework of Hatfield and Milgrom [20], and we introduce new concepts of bilateral and unilateral substitutes. We show that the bilateral substitutes condition is a sufficient condition for the existence of a stable allocation in this framework. However, the set of stable allocations does not form a lattice under this condition, and there does not necessarily exist a doctor-optimal stable allocation. Under a slightly stronger condition, unilateral substitutes, the set of stable allocations still does not necessarily form a lattice with respect to doctors' preferences, but there does exist a doctor-optimal stable allocation, and other key results such as incentive compatibility and the rural hospitals theorem are recovered.     

Bargaining and inequity aversion: On the efficiency of the double auction

In a bargaining setting with asymmetrically informed, inequity-averse parties, a fully efficient mechanism (i.e., the double auction) exists if and only if compassion is strong. Less compassionate parties do not trade in the double auction in the limit of strong envy.     

Matching through position auctions

Using a mechanism design framework, we characterize how a profit-maximizing intermediary can design matching markets when each agent is privately informed about his quality as a partner. Sufficient conditions are provided that ensure a version of positive assortative matching (what we call truncated positive assortative matching) maximizes profits. Under these conditions, all-pay position auctions always implement the profit-maximizing allocation. Winners-pay position auctions, however, only do so in sufficiently large markets.     

Sorting versus screening: Search frictions and competing mechanisms

In a market where sellers compete by posting trading mechanisms, we allow for a general search technology and show that its features crucially affect the equilibrium mechanism. Price posting prevails when meetings are rival, i.e., when a meeting by one buyer reduces another buyer's meeting probability. Under price posting buyers reveal their type by sorting ex-ante. Only if the meeting technology is sufficiently non-rival, price posting is not an equilibrium. Multiple buyer types then visit the same sellers who screen ex-post through auctions.     

Relaxing the substitutes condition in matching markets with contracts

In the many-to-one matching model with contracts, I provide new necessary and new sufficient conditions for the existence of a stable allocation. These new conditions exploit the fact that one side of the market has strict preferences over individual contracts.     

Group robust stability in matching markets

We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable mechanism even under acyclic priority structures. Next, we define a weak version of group robust stability, called weak group robust stability. Our main theorem, then, proves that there is a weakly group robustly stable mechanism if and only if the priority structure of schools is acyclic, and in that case, it coincides with the student-optimal stable mechanism.     

Incomplete information and singleton cores in matching markets

We study ordinal Bayesian Nash equilibria of stable mechanisms in centralized matching markets under incomplete information. We show that truth-telling is an ordinal Bayesian Nash equilibrium of the revelation game induced by a common belief and a stable mechanism if and only if all the profiles in the support of the common belief have singleton cores. Our result matches the observations of Roth and Peranson [The redesign of the matching market for American physicians: some engineering aspects of economic design, Amer. Econ. Rev. 89 (1999) 748-780] in the National Resident Matching Program (NRMP) in the United States: (i) the cores of the profiles submitted to the clearinghouse are small and (ii) while truth-telling is not a dominant strategy most participants in the NRMP truthfully reveal their preferences.     

Bidding for money

We analyze monetary exchange in a model that allows for directed search and multilateral matches. We consider environments with divisible goods and indivisible money, and compare the results with those in models that use random matching and bilateral bargaining. Two different pricing mechanisms are used: ex ante price posting, and ex post bidding (auctions). Also, we consider settings both with and without lotteries. We find that the model generates very simple and intuitive equilibrium allocations that are similar to those with random matching and bargaining, but with different comparative static and welfare properties.     

ON DETAIL‐FREE MECHANISM DESIGN AND RATIONALITY*

Mechanism design theory has been criticized, because mechanisms depend on the detail of specification and agents’ behaviour relies on strong rationality assumptions. Hence the study of “detail‐free” mechanism design with weak rationality is important as a practical theory. This paper emphasizes that, even if we confine our attention to detail‐free mechanisms with weak rationality, there exists plenty of scope for the development of new and significant ideas. I describe my recent work along these lines, and argue that stochastic decisions work in large double auction environments, and that moral preferences improve the implementability of social choice functions.     

Partnerships, lemons, and efficient trade

We analyze the possibility of efficient trade with informationally interdependent valuations and with a dispersed ownership. A main role is played by the effects of adverse selection on incentive payments and budget constraints. Variations in the degree of interdependence directly influence the incentive payments and ultimately lead to a tightening or relaxation of the budget constraint, thus affecting the ability to achieve efficient trade. We derive precise possibility conditions for efficient trade, and we offer a framework in which the interplay of insights previously obtained by Akerlof (Quart. J. Econom. 89 (1970) 488), Myerson and Satterthwaite (J. Econom. Theory 28 (1983) 265), and Cramton et al. (Econometrica 55 (1987) 615) can be analyzed. In addition, we discuss to what extent possibility results previously obtained for private values environments can be generalized.     

A nearly optimal auction for an uninformed seller

This paper describes a nearly optimal auction mechanism that does not require previous knowledge of the distribution of values of potential buyers. The mechanism we propose builds on the new literature on the elicitation of information from experts. We extend the latter to the case where the secret information shared by the experts–potential buyers in our model–can be used against them if it becomes public knowledge.     

The ratchet effect and bargaining power in a two-stage model of competitive bidding

Summary. In the model presented, a buyer uses competitive bidding to facilitate her purchase of a good (the primary good of the exchange). Not included in the original purchase is the possible procurement of a good related to the original purchase: the supplementary good. The primary and supplementary goods are closely related; knowing a bidder's cost of producing the primary good implies that the buyer can infer the bidder's cost of producing the supplementary good. I show that a bidding mechanism for the primary good will fail to ensure an efficient allocation if the buyer learns the bid of the winner and the price of the supplementary good is determined through sequential bargaining. Received: August 22, 1996; revised version: June 23, 1997     

Branching bandits: a sequential search process with correlated pay-offs

This paper presents a model of a sequential search process for the best outcome of many multi-stage projects. The branching structure of the search environment is such that the payoffs to various actions are correlated; nevertheless, it is shown that the optimal strategy is given by a simple reservation price rule.     

When less is more: Rationing and rent dissipation in stochastic contests

This paper shows how to maximize revenue when a contest is noisy. We consider a case where two or more contestants bid for a prize in a stochastic contest where all bidders value the prize equally. We show that, whenever a Tullock contest yields under-dissipation, the auctioneer?s revenue can be increased by optimally fixing the number of tickets. In particular, in a stochastic contest with proportional probabilities, it is possible to obtain (almost) full rent dissipation. We test this hypothesis with a laboratory experiment. The results indicate that, as predicted, revenue is significantly higher in a lottery with rationing than in a standard lottery. On the other hand, an alternative rationing mechanism that does not limit total expenditures fails to increase revenue relative to a standard lottery.     

WHO SEARCHES?*

We consider a directed search model with buyers and sellers and determine whether buyers look for sellers or vice versa. The buyers and sellers can choose to search or wait; what they do in equilibrium depends on the relative size of the two populations and the price formation mechanism. We study bargaining and auctions and find that when one population is much larger than the other the former searches and the latter waits. Under auction with roughly equal populations some buyers and sellers search and some wait. Our results challenge the practice of postulating who searches and who waits.     

Mechanism design with side payments: Individual rationality and iterative dominance

We investigate the collective decision with incomplete information and side payments. We show that a direct mechanism associated with the social choice function that satisfies budget balancing, incentive compatibility, and interim individual rationality exists for generic prior distributions. We consider the possibility that a risk-averse principal extracts full surplus in agency problems with adverse selection. With regard to generic prior distributions, we show that there exists a modified direct mechanism associated with the virtual social choice function, which satisfies budget balancing and interim individual rationality, such that truth telling is the unique three times iteratively undominated message rule profile.     

Implementation of college admission rules

Summary We consider both Nash and strong Nash implementation of various matching rules for college admissions problems. We show that all such rules are supersolutions of the stable rule. Among these rules the lower bound stable rule is implementable in both senses. The upper bound Pareto and individually rational rule is strong Nash implementable yet it is not Nash implementable. Two corollaries of interest are the stable rule is the minimal (Nash or strong Nash) implementable solution that is Pareto optimal and individually rational, and the stable rule is the minimal (Nash or strong Nash) implementable extension of any of its subsolutions.We wish to thank Professor William Thomson for his efforts in supervision as well as his useful suggestions. We are grateful to the participants in his reading class, workshops at Bilkent University, University of Rochester, and in particular Jeffrey Banks, Stephen Ching, Bhaskar Dutta, Rangarajan Sundaram and an anonymous referee for their helpful comments.     

Monotonic and implementable solutions in generalized matching problems

We consider one-to-one matching problems when preferences are weak orders and search for (Maskin-)monotonic and implementable solutions. We show that for any coalition structure , the strong -core is monotonic if and only if it is the individually rational solution. We introduce a solution, which we call the “union strong -core”, and show that this solution is the minimal way to expand the strong -core recovering monotonicity. We also show that the union strong -core is implementable.     

Connecting the cooperative and competitive structures of the multiple-partners assignment game

Multiple-partners assignment game is the name used by Sotomayor [The multiple partners game, in: M. Majumdar (Ed.), Equilibrium and Dynamics: Essays in Honor of David Gale, The Macmillan Press Ltd., New York, 1992; The lattice structure of the set of stable outcomes of the multiple partners assignment game, Int. J. Game Theory 28 (1999) 567-583] to describe the cooperative structure of the many-to-many matching market with additively separable utilities. Stability concept is proved to be different from the core concept. An economic structure is proposed where the concept of competitive equilibrium payoff is introduced in connection to the equilibrium concept from standard microeconomic theory. The paper examines how this equilibrium concept compares with the cooperative equilibrium concept. Properties of interest to the cooperative and competitive markets are derived.