Sy Syms School of Business (SSSB)
Permanent URI for this communityhttps://hdl.handle.net/20.500.12202/9
Browse
Browsing Sy Syms School of Business (SSSB) by Subject "Assortative matching"
Now showing 1 - 1 of 1
- Results Per Page
- Sort Options
Item Open Access Generalized Coarse Matching.(Elsevier, 2016-11) Shao, Ran; 0000-0002-1736-9862This paper analyzes the problem of matching two heterogeneous populations, such as men and women. If the payoff from a match exhibits complementarities, it is well known that, absent any friction, positive assortative matching is optimal. Coarse matching refers to a situation in which the populations are sorted into a finite number of classes and then randomly matched within these classes. We derive upper bounds on the fraction of the total efficiency loss of n-class coarse matching, which is proportional to . Our result substantially enlarges the scope of matching problems in which the performance of coarse matching can be assessed.