We study a dynamic matching environment where individuals arrive sequentially. There is a tradeoff between waiting for a thicker market, allowing for higher quality matches, and minimizing agents' waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and...

Stability is often the goal for clearinghouses in matching markets, such as those matching residents to hospitals, students to schools, etc. Stable outcomes absent transfers need not be utilitarian efficient, suggesting the potential value of transfers. We study the wedge between stability and...

We study the impacts of incomplete information on centralized one-to-one matching markets. We focus on the commonly used Deferred Acceptance mechanism (Gale and Shapley, 1962). We show that many complete-information results are fragile to a small infusion of uncertainty about others' preferences

We study a simple model of a decentralized market game in which firms make directed offers to workers. We focus on markets in which agents have aligned preferences. When agents have complete information or when there are no frictions in the economy, there exists an equilibrium that yields the...

We experimentally study decentralized one-to-one matching markets with transfers. We vary the information available to participants, complete or incomplete, and the surplus structure, supermodular or submodular. Several insights emerge. First, while markets often culminate in efficient...

We experimentally study decentralized one-to-one matching markets with transfers. We vary the information available to participants, complete or incomplete, and the surplus structure, supermodular or submodular. Several insights emerge. First, while markets often culminate in efficient...