Matching and sorting in online dating

GJ Hitsch, A Hortaçsu, D Ariely - American Economic Review, 2010 - aeaweb.org
American Economic Review, 2010aeaweb.org
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, ie,
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 …
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)
aeaweb.org