Generalized coarse matching

• 成果类型: Article
• 署名作者: Shao, Ran
• 署名单位: Yeshiva University
• 刊物名称: GAMES AND ECONOMIC BEHAVIOR
• ISSN/ISSBN: 0899-8256
• DOI: 10.1016/j.geb.2016.09.008
• 发表日期: 2016
• 页码: 142-148
• 关键词: Coarse matching; Grass's inequality; assortative matching

摘要

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 1/n(2). Our result substantially enlarges the scope of matching problems in which the performance of coarse matching can be assessed. (C) 2016 Elsevier Inc. All rights reserved.