This setting lets you change the way you view articles. You can choose to have articles open in a dialog window, a new tab, or directly in the same window.
Open in Dialog
Open in New Tab
Open in same window

American Economic Review: Vol. 100 No. 1 (March 2010)

Expand

Quick Tools:

Print Article Summary
Export Citation
Sign up for Email Alerts Follow us on Twitter

Explore:

AER - All Issues

AER Forthcoming Articles

Matching and Sorting in Online Dating

Article Citation

Hitsch, Gunter J., Ali Hortaçsu, and Dan Ariely. 2010. "Matching and Sorting in Online Dating." American Economic Review, 100(1): 130-63.

DOI: 10.1257/aer.100.1.130

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)

Article Full-Text Access

Full-text Article

Additional Materials

Download Data Set (253.77 KB)

Authors

Hitsch, Gunter J. (U Chicago)
Hortaçsu, Ali (U Chicago)
Ariely, Dan (Duke U)

JEL Classifications

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


American Economic Review


Quick Tools:

Sign up for Email Alerts

Follow us on Twitter

Subscription Information
(Institutional Administrator Access)

Explore:

AER - All Issues

AER - Forthcoming Articles

Virtual Field Journals


AEA Member Login:


AEAweb | AEA Journals | Contact Us