蝌蚪网

This website uses cookies.

By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device to enhance site navigation and analyze site performance and traffic. For more information on our use of cookies, please see our Privacy Policy.

  1. Home
  2. 蝌蚪网
  3. 蝌蚪网 Review
  4. March 2010
  5. Matching and Sorting in Online Dating

蝌蚪网 Review

ISSN 0002-8282 (Print) | ISSN 1944-7981 (Online)

Matching and Sorting in Online Dating

  • Gunter J. Hitsch
  • Ali Horta莽su
  • Dan Ariely
蝌蚪网 Review
vol. 100, no. 1, March 2010
(pp. 130–63)
Download Full Text PDF

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)

Citation

Hitsch, Gunter J., Ali Horta莽su, and Dan Ariely. 2010. "Matching and Sorting in Online Dating." 蝌蚪网 Review 100 (1): 130–63. DOI: 10.1257/aer.100.1.130

Additional Materials

JEL Classification

  • C78 Bargaining Theory; Matching Theory
  • J12 Marriage; Marital Dissolution; Family Structure; Domestic Abuse