Replication data for: Matching and Sorting in Online Dating

Principal Investigator(s): View help for Principal Investigator(s) Gunter J. Hitsch; Ali Hortaçsu; Dan Ariely

Name	File Type	Size	Last Modified
20080317_data			10/11/2019 02:31:PM
LICENSE.txt	text/plain	14.6 KB	10/11/2019 10:31:AM

Project Citation:

Hitsch, Gunter J., Hortaçsu, Ali, and Ariely, Dan. Replication data for: Matching and Sorting in Online Dating. Nashville, TN: American Economic Association [publisher], 2010. Ann Arbor, MI: Inter-university Consortium for Political and Social Research [distributor], 2019-10-11. https://doi.org/10.3886/E112322V1

Project Description

Summary: 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)

Scope of Project

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

Related Publications

Download this project

Published Versions

V1 [2019-10-11]

Export Metadata

Dublin Core

DDI 2.5

Report a Problem

Found a serious problem with the data, such as disclosure risk or copyrighted content? Let us know.

This material is distributed exactly as it arrived from the data depositor. ICPSR has not checked or processed this material. Users should consult the investigator(s) if further information is desired.