Replication data for: Matching and Sorting in Online Dating
Principal Investigator(s): View help for Principal Investigator(s) Ali Hortaçsu; Gunter J. Hitsch; Dan Ariely
Version: View help for Version V1
Name | File Type | Size | Last Modified |
---|---|---|---|
20080317_data | 08/01/2019 09:29:AM | ||
LICENSE.txt | text/plain | 14.6 KB | 08/01/2019 05:29:AM |
Project Citation:
Project Description
Summary:
View help for 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:
View help for JEL Classification
J12 Marriage • Marital Dissolution • Family Structure • Domestic Abuse
C78 Bargaining Theory • Matching Theory
J12 Marriage • Marital Dissolution • Family Structure • Domestic Abuse
C78 Bargaining Theory • Matching Theory
Related Publications
Published Versions
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.