Finding the one: optimal choosiness under sequential mate choice

Jonathan M. Henshaw*

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    16 Citations (Scopus)

    Abstract

    When mates are encountered sequentially, each encounter involves a decision whether to reject the current suitor and risk not finding a better mate, or to accept them despite their flaws. I provide a flexible framework for modelling optimal choosiness when mate encounters occur unpredictably in time. The model allows for temporal variation in the fitness benefits of mating, including seasonal breeding conditions, accrual of mate search costs, survival of the choosing individual or senescence of gametes. The basic optimality framework can be applied iteratively to obtain mate choice equilibria in dynamically evolving populations. My model predicts that individuals should be choosier when the average rate of mate encounters is high, but that choosiness should decline over time as the likelihood of future mate encounters decreases. When mate encounters are uncertain, there is a trade-off between reproductive timing and mate choice (the ‘when’ and the ‘who’). Mate choice may be selected against when reproductive timing is highly important (e.g. when breeding conditions show a narrow peak in time). This can even lead to step-shaped mate choice functions, where individuals abruptly switch from rejecting to accepting all suitors as peak breeding conditions approach. The model contributes to our understanding of why individuals may not express mate preferences, even when there is substantial variation in mate quality.

    Original languageEnglish
    Pages (from-to)1193-1203
    Number of pages11
    JournalJournal of Evolutionary Biology
    Volume31
    Issue number8
    DOIs
    Publication statusPublished - Aug 2018

    Fingerprint

    Dive into the research topics of 'Finding the one: optimal choosiness under sequential mate choice'. Together they form a unique fingerprint.

    Cite this