Please use this identifier to cite or link to this item:
Title: Generalized Coarse Matching.
Authors: Shao, Ran
Keywords: Coarse matching
Grüss's inequality
Assortative matching
Issue Date: Nov-2016
Publisher: Elsevier
Citation: Shao, Ran. November 2016. Generalized coarse matching. Games and Economic Behavior. 100, 142-148.
Abstract: This 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.
ISSN: 0899-8256
Appears in Collections:Sy Syms School of Business (SSSB) -- Faculty Publications

Files in This Item:
File Description SizeFormat 
GEB final.pdf259.42 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons