Search theory,competitive equilibrium,and the Nash bargaining solution

We investigate a canonical search-theoretic model without entry. Two agents are randomly matched with a long side being rationed. The matched agents face a pair of randomly drawn non-transferable payoffs, and then choose whether or not to form a partnership subject to a small probability of exogenous break down. As this probability and friction vanish, the Nash bargaining solution emerges as the unique undominated strategy equilibrium outcome if the mass of each party is the same. If the size of one party is larger than the other, the short side extracts the entire surplus, a sharp contrast to Rubinstein and Wolinsky (1985) [16].     

On two competing mechanisms for priority-based allocation problems

We consider the priority-based allocation problem: there is a set of indivisible objects with multiple supplies (e.g., schools with seats) and a set of agents (e.g., students) with priorities over objects (e.g., proximity of residence area). We study two well-known and competing mechanisms. The agent-optimal stable mechanism (AOSM) allots objects via the deferred acceptance algorithm. The top trading cycles mechanism (TTCM) allots objects via Gale's top trading cycles algorithm. We show that the two mechanisms are equivalent, or TTCM is fair (i.e., respects agents’ priorities), or resource monotonic, or population monotonic, if and only if the priority structure is acyclic. Furthermore, if AOSM fails to be efficient (consistent) for a problem, TTCM also fails to be fair (consistent) for it. However, the converse is not necessarily true.     

The rate of convergence to perfect competition of matching and bargaining mechanisms

We study the steady state of a market with incoming cohorts of buyers and sellers who are matched pairwise and bargain under private information. A friction parameter is τ, the length of the time period until the next meeting. We provide a necessary and sufficient condition for the convergence of mechanism outcomes to perfect competition at the linear rate in τ, which is shown to be the fastest possible among all bargaining mechanisms. The condition requires that buyers and sellers always retain some bargaining power. The bargaining mechanisms that satisfy this condition are called nonvanishing bargaining power (NBP) mechanisms. Simple random proposer take-it-or-leave-it protocols are NBP, while k-double auctions (k-DA) are not. We find that k-DAs have equilibria that converge to perfect competition at a linear rate, converge at a slower rate or even do not converge at all.     

Pricing and signaling with frictions

We study a market where each seller chooses the quality and price of goods and the number of selling sites. Observing sellers? choices of prices and sites, but not quality, buyers choose which site to visit. A seller?s choices of prices can direct buyers? search and signal quality. A unique equilibrium exists and is separating. When the quality differential is large, the equilibrium implements the efficient allocation with public information. Otherwise, the quality of goods and/or the number of sites created is inefficient, due to a conflict between the search-directing and signaling roles of prices.     

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.     

Sorting by search intensity

In this paper, I characterize matching in an on-the-job search model with endogenous search intensity, heterogeneous workers and firms, and match surplus is shared between workers and firms through bargaining. I provide proof of existence and uniqueness of steady state equilibrium. Given equally efficient matched and unmatched search, the worker skill conditional distribution of firm productivity over matches is stochastically increasing (decreasing) in worker skill if the production function is supermodular (submodular). I also show that this strong notion of sorting does not obtain everywhere for the firm productivity conditional match distribution.     

Sealed bid auctions with ambiguity: Theory and experiments

This study presents a laboratory experiment of the first and second price sealed bid auctions with independent private values, where the distribution of bidder valuations may be unknown. In our experimental setting, in first price auctions, bids are lower with the presence of ambiguity. This result is consistent with ambiguity loving in a model that allows for different ambiguity attitudes. We also find that the first price auction generates significantly higher revenue than the second price auction with and without ambiguity.     

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.     

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.     

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].     

Contractual distortions in a market with frictions

This paper analyses contract design in a decentralized market environment with frictions. While principals (e.g., firms) have all contractual power, their market power is constrained as agents (e.g., workers) can choose to wait and search for better offers. We find that results depend crucially on how market frictions affect agents’ utilities. With type-independent costs of search and waiting, equilibrium contracts are always first-best. If agents are impatient and discount future payoffs, however, distortions vanish only gradually. In the latter case, we also characterize equilibrium offers and show that the market exhibits two types of externalities, both of which are absent in the case of type-independent costs of search.     

Fictitious play property of the Nash demand game

We show that the Nash demand game has the fictitious play property. We also show that almost every fictitious play process and its associated belief path converge to a pure-strategy Nash equilibrium in the Nash demand game.     

The role of private information in dynamic matching and bargaining: Can it be good for efficiency?

We consider a private information replica of the dynamic matching and bargaining model of Mortensen and Wright (2002). We find that private information typically deters entry. But, the welfare can actually be higher under private information.     

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.     

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.     

Why do people place lower weight on advice far from their own initial opinion?

Experimental studies find that the weight put on advice is negatively related to the distance between the advice and the decision-maker’s initial opinion. We show that this can be rational if the decision-maker has imperfect knowledge about the advisor’s competence.