Replication data for: Matching and Sorting in Online Dating
- Hitsch, Gunter J.
- Hortaçsu, Ali
- Ariely, Dan
AbstractUsing 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)
Is supplement to
DOI: 10.1257/aer.100.1.130 (Text)
Hitsch, Günter J, Ali Hortaçsu, and Dan Ariely. “Matching and Sorting in Online Dating.” American Economic Review 100, no. 1 (March 2010): 130–63. https://doi.org/10.1257/aer.100.1.130.
- ID: 10.1257/aer.100.1.130 (DOI)
Update Metadata: 2020-05-18 | Issue Number: 2 | Registration Date: 2019-10-11