Matching and Sorting in Online Dating

S-Tier
Journal: American Economic Review
Year: 2010
Volume: 100
Issue: 1
Pages: 130-63

Authors (3)

Gunter J. Hitsch (not in RePEc) Ali Hortaçsu (not in RePEc) Dan Ariely (not in RePEc)

Score contribution per author:

2.681 = (α=2.01 / 3 authors) × 4.0x S-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

Using data on user attributes and interactions from an online dating site, we estimate mate preferences, and use the Gale-Shapley algorithm to predict stable matches. The predicted matches are similar to the actual matches achieved by the dating site, and the actual matches are approximately efficient. Out-of- sample predictions of offline matches, i.e., marriages, exhibit assortative mating patterns similar to those observed in actual marriages. Thus, mate preferences, without resort to search frictions, can generate sorting in marriages. However, we underpredict some of the correlation patterns; search frictions may play a role in explaining the discrepancy. (JEL C78, J12)

Technical Details

RePEc Handle
repec:aea:aecrev:v:100:y:2010:i:1:p:130-63
Journal Field
General
Author Count
3
Added to Database
2026-02-02