Abstract
In this paper, we consider a one-to-one matching model with two phases; an adolescence phase where individuals meet a number of dates and learn about their aspirations, followed by a matching phase where individuals are matched according to a version of Gale and Shapley's (1962) deferred acceptance (DA) algorithm. Using simulations of this model, we study how the likelihoods of matching and divorce, and also the balancedness and the speed of matching associated with the outcome of the DA algorithm are affected by the size of correlation in the preferences of individuals and by the frequency individuals update their aspirations in the adolescence phase.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
