We study a setting in which dynamically arriving items are assigned to waiting agents, who have heterogeneous values for distinct items and heterogeneous outside options. An ideal match would both target items to agents with the worst outside options, and match them to items for which they have...

Stable matching mechanisms are used to clear many two-sided markets. In practice, these mechanisms leave many agents on both sides unmatched. What factors determine the number of unmatched agents, and the quality of matches that do form? This paper answers this question, with a particular focus...

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

We model an online display advertising environment in which "performance'' advertisers can measure the value of individual impressions, whereas "brand" advertisers cannot. If advertiser values for ad opportunities are positively correlated, second-price auctions for impressions can be...