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

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