Show simple item record

dc.contributor.authorShao, Ran
dc.date.accessioned2018-10-22T19:02:27Z
dc.date.available2018-10-22T19:02:27Z
dc.date.issued2016-11
dc.identifier.citationShao, Ran. November 2016. Generalized coarse matching. Games and Economic Behavior. 100, 142-148.en_US
dc.identifier.issn0899-8256
dc.identifier.urihttps://doi.org/10.1016/j.geb.2016.09.008en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12202/4019
dc.description.abstractThis 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.en_US
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectCoarse matchingen_US
dc.subjectGrüss's inequalityen_US
dc.subjectAssortative matchingen_US
dc.titleGeneralized Coarse Matching.en_US
dc.typeArticleen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States