Assortative Matching and Search
AbstractIn Becker's (1973) neoclassical marriage market model, matching is positively assortative if types are complements: i.e. match output is supermodular. We reprise this famous result assuming time-intensive partner search and transferable output. We prove existence of a search equilibrium with a continuum of types, and then characterize matching. After showing that Becker's conditions no longer suffice for assortative matching, we find sufficient conditions valid for any search frictions and type distribution: supermodularity not only of match output, but also of its marginal product and cross partial derivative. Symmetric submodularity conditions imply negatively assortative matching. Examples show these conditions are necessary.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoArticle provided by Econometric Society in its journal Econometrica.
Volume (Year): 68 (2000)
Issue (Month): 2 (March)
Other versions of this item:
- Shimer, R. & Smith, L., 1997. "Assortative Matching and Search," Working papers 97-2a, Massachusetts Institute of Technology (MIT), Department of Economics.
- Shimer, R. & Smith, L., 1998. "Assortive Matching and Search," Papers 98-09, Michigan - Center for Research on Economic & Social Theory.
- Shimer, R. & Smith, L., 1997. "Assortative Matching and Search," Working papers 97-2b, Massachusetts Institute of Technology (MIT), Department of Economics.
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. 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: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.