Matching With Phantoms
AbstractSearching for partners involves informational persistence that reduces future traders' matching probability. In this paper, traders that are no longer available but who left tracks on the market are called phantoms. I examine a discrete-time matching market in which phantom traders are a by-product of search activity, no coordination frictions are assumed, and non-phantom traders may lose time trying to match with phantom traders. The resulting aggregate matching technology features increasing returns to scale in the short run, but has constant returns to scale in the long run. I discuss the labor market evidence and argue that there is observational equivalence between phantom unemployed and on-the-job seekers.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by HAL in its series Working Papers with number halshs-00472751.
Date of creation: 13 Apr 2010
Date of revision:
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00472751/en/
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Endogenous matching technology; Intertemporal and intratemporal congestion externalities; Information persistence;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-04-24 (All new papers)
- NEP-DGE-2010-04-24 (Dynamic General Equilibrium)
- NEP-GTH-2010-04-24 (Game Theory)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
If references are entirely missing, you can add them using this form.