In a market in which sellers compete for heterogeneous buyers by posting mechanisms, we analyze how the properties of the meeting technology affect the allocation of buyers to sellers. We show that a separate submarket for each type of buyer is the efficient outcome if and only if meetings are...

The literature offers two foundations for competitive search equilibrium, a Nash approach and a market-maker approach. When each buyer visits only one seller (or each worker makes only one job application), the two approaches are equivalent. However, when each buyer visits multiple sellers, this...

We consider a labor market with search frictions in which workers make multiple applications and firms can post and commit to general mechanisms that may be conditioned both on the number of applications received and on the number of offers received by its candidate. When the contract space...

This paper considers a random search model where some locations provide sellers with better chances of meeting many buyers than other locations (for example popular shopping streets or the first page of a search engine). When sellers are heterogeneous in terms of the quality of their product...

This paper considers competitive search equilibrium in a market for a good whose quality differs across sellers. Each seller knows the quality of the good that he or she is offering for sale, but buyers cannot observe quality directly. We thus have a "market for lemons" with competitive search...

This paper reports results from a laboratory experiment studying the role of asymmetries, both in payoffs and recognition probabilities, in a model of strategic bargaining with Condorcet cycles. Overall, we find only limited support for the equilibrium predictions. The main deviations from...

We study a bargaining model with a disagreement game between offers and counteroffers. In order to characterize the set of its subgame perfect equilibrium payoffs, we provide a recursive technique that relies on the Pareto frontier of equilibrium payoffs. When players have different time...

We introduce a form of pre-play communication that we call preopening. During the preopening, players announce their tentative actions to be played in the underlying game. Announcements are made using a posting system which is subject to stochastic failures. Posted actions are publicly...

We analyze the simplest Condorcet cycle with three players and three alternatives within a strategic bargaining model with recognition probabilities and costless delay. Mixed consistent subgame perfect equilibria exist whenever the geometric mean of the agents' risk coefficients, ratios of...