IDEAS home Printed from https://ideas.repec.org/p/frz/wpaper/wp2019_04.rdf.html
   My bibliography  Save this paper

Marriage Formation with Randomor Assortative Meeting

Author

Listed:
  • Elena Parilina
  • Alessandro Tampieri

Abstract

In this paper, we study marriage formation in an optimal stopping problem where meetings can be of two types: one in which individuals meet potential partners randomly, and one ("assortative") in which the meeting occurs between individuals with similar characteristics. The presence of assortative meetings influences the expectations of the quality of potential spouses, and in turn the marriage choice. We show that individuals of high rank tend to be pickier 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 can make them marry earlier than individuals with a lower universal characteristic. In particular, individuals with medium rank tend to marry later than the other types, since they are picky but the quality of their potential partners is usually lower than for high-rank individuals.

Suggested Citation

  • Elena Parilina & Alessandro Tampieri, 2019. "Marriage Formation with Randomor Assortative Meeting," Working Papers - Economics wp2019_04.rdf, Universita' degli Studi di Firenze, Dipartimento di Scienze per l'Economia e l'Impresa.
    • Handle: RePEc:frz:wpaper:wp2019_04.rdf
    as

    Download full text from publisher

    File URL: https://www.disei.unifi.it/upload/sub/pubblicazioni/repec/pdf/wp04_2019.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    secretary problem; mate choice; random meeting; assortative meeting;
    All these keywords.

    JEL classification:

    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:frz:wpaper:wp2019_04.rdf. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Giorgio Ricchiuti (email available below). General contact details of provider: https://edirc.repec.org/data/defirit.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.