Marriage Formation with Assortative Meeting as a Two-Sided Optimal Stopping Problem
Alessandro Tampieri
DEM Discussion Paper Series from Department of Economics at the University of Luxembourg
Abstract:
In this paper we study marriage formation through a two-sided secretary problem approach. We consider individuals with non transferable utility and two different dimensions of heterogeneity, a characteristic evaluated according to the idiosyncratic preferences of potential partners, and a universally-rankable characteristic. There are two possible states of the world, one in which people meet their partner randomly, and one in which the meeting occurs between individuals with similar characteristics. We show that individuals with higher universal characteristic tend to be more picky in their marriage hunting. This does not necessarily mean that they marry later than other individuals, since the higher expected quality of their potential partners in the assortative meeting state can make them marry earlier than individuals with a lower universal characterictic.
Keywords: secretary problem; random meeting; assortative meeting (search for similar items in EconPapers)
JEL-codes: C73 C78 (search for similar items in EconPapers)
Date: 2013
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://hdl.handle.net/10993/13270 (application/pdf)
Related works:
Working Paper: Marriage Formation with Assortative Meeting as a Two-Sided Optimal Stopping Problem (2013) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:luc:wpaper:13-29
Access Statistics for this paper
More papers in DEM Discussion Paper Series from Department of Economics at the University of Luxembourg Contact information at EDIRC.
Bibliographic data for series maintained by Marina Legrand ().