We study how to reduce congestion in two-sided matching markets with private preferences. We measure congestion by the number of bits of information that agents must (i) learn about their own preferences, and (ii) communicate with others before obtaining their final match. Previous results by...

It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will nd a stable matching with high probability. In particular we...

We consider a one-sided assignment market or exchange network with transferable utility and the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of ‘offers’ based on estimated best alternative matches, in the spirit of pairwise Nash...

In a large online market, buyers were given the opportunity to signal their relative preferences over price and quality—first experimentally, then later as the default experience in the market. The possibility of signaling caused substantial sorting by sellers to buyers of the right...

Participants in matching markets face search and screening costs when seeking a match. We study how platform design can reduce the effort required to find a suitable partner. We study a game-theoretic model in which "applicants" and "employers" pay costs to search and screen. An important...