Matching and Sorting in Online Dating | Zendy

Günter J. Hitsch | Zendy; Alı Hortaçsu | Zendy; Dan Ariely | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Matching and Sorting in Online Dating

Author(s) -

Günter J. Hitsch,

Alı Hortaçsu,

Dan Ariely

Publication year - 2010

Publication title -

american economic review

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 16.936

H-Index - 297

eISSN - 1944-7981

pISSN - 0002-8282

DOI - 10.1257/aer.100.1.130

Subject(s) - sorting , matching (statistics) , assortative mating , economics , sample (material) , econometrics , mating , computer science , statistics , mathematics , algorithm , biology , ecology , chemistry , chromatography

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research