Matching and Sorting in Online Dating

2010/03/01 by Günter J Hitsch, Alı Hortaçsu, Dan Ariely · 2 citations
Psychology · Social Sciences · #Evolutionary Psychology and Human Behavior #Names, Identity, and Discrimination Research #Marriage and Sexual Relationships

paper · doi:10.1257/aer.100.1.130

openalex publication_date 2010/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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)

Citations

• College Admissions and the Stability of Marriage
• Who Marries Whom and Why
• Maxims or myths of beauty? A meta-analytic and theoretical review.
• Sex differences in mate preferences revisited: Do people know what they initially desire in a romantic partner?
• The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory
• Gender Differences in Mate Selection: Evidence From a Speed Dating Experiment
• Analysis of Covariance with Qualitative Data

Cited by

• Leveling the Playing Field
• Physical attractiveness [wikipedia]