We model signalling in two-sided sequential search with heterogeneous agents and transferable utility. Search via meetings is time-consuming and thereby costly due to discounting. Search via signals is costless, so that agents can avoid almost all search costs if only the signals are truthful. We show that signals will indeed be truthful if the match output function is su ciently super- modular. The unique separating equilibrium is then characterised by perfect positive assortative matching despite the search frictions. In this equilibrium, agents successfully conclude their search after a single meeting, and overall match output is maximised. These results continue to hold when there are also explicit search costs in addition to discounting.
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.