Saglam, Ismail (2017): A New Heuristic in Mutual Sequential Mate Search.
Preview |
PDF
MPRA_paper_79448.pdf Download (672kB) | Preview |
Abstract
In this paper, we propose a new heuristic to be used as a mate search strategy in the Todd and Miller's (1999) human mate choice model. This heuristic, which we call Take the Weighted Average with the Next Desiring Date, is a plausible search rule in terms of informational assumptions, while in terms of mating likelihood it is almost as good as the most successful, yet also unrealistic, heuristic of Todd and Miller (1999), namely the Mate Value-5 rule, which assumes that agents in the mating population completely know their own mate values before interacting with any date. The success of our heuristic stems from its extreme power to lead an average agent in the mating population to always underestimate his/her own mate value during the adolescence (learning) phase of the mating process. However, this humble heuristic does not perform well in terms of marital stability. We find that the mean within-pair difference is always higher under our heuristic (possibly due to high estimation errors made in the learning phase) than under any heuristic of Todd and Miller (1999). It seems that becoming ready to pair up with agents whose mate values are well below one's own mate value pays off well in the mating phase but also incurs an increased risk of marital dissolution.
Item Type: | MPRA Paper |
---|---|
Original Title: | A New Heuristic in Mutual Sequential Mate Search |
English Title: | A New Heuristic in Mutual Sequential Mate Search |
Language: | English |
Keywords: | Mate Choice; Mate Search; Simple Heuristics; Agent-Based Simulation |
Subjects: | C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C63 - Computational Techniques ; Simulation Modeling J - Labor and Demographic Economics > J1 - Demographic Economics > J12 - Marriage ; Marital Dissolution ; Family Structure ; Domestic Abuse |
Item ID: | 79448 |
Depositing User: | Ismail Saglam |
Date Deposited: | 30 May 2017 04:37 |
Last Modified: | 01 Oct 2019 08:14 |
References: | APTECH SYSTEMS. (1998) GAUSS version 3.2.34. Maple Valley, WA: Aptech Systems, Inc. COLLINS, E. J., McNamara, J. M. & Ramsey, D. M. (2006) Learning rules for optimal selection in a varying environment: Mate choice revisited. Behavioral Ecology, 17, 799-809. DOMBROVSKY, Y. & Perrin, N. (1994) On adaptive search and optimal stopping in sequential mate choice. American Naturalist, 144, 355-361. MAZALOV, V., Perrin, N. & Dombrovsky, Y. (1996) Adaptive search and information updating in sequential mate choice. American Naturalist, 148, 123-137. NASH, J. (1950) Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 36, 48-49. SAGLAM, I., (2014) Simple heuristics as equilibrium strategies in mutual sequential mate search. Journal of Artificial Societies and Social Simulation, 17 (1), 12. SHIBA, N., (2013) Analysis of asymmetric two-sided matching: Agent-based simulation with theorem-proof approach. Journal of Artificial Societies and Social Simulation, 16 (3), 11. TODD, P. M. (1997) Searching for the next best mate. In R. Conte, R. Hegselmann & P. Terna (Eds.), Simulating Social Phenomena (pp. 419-436). Berlin: Springer-Verlag. TODD, P. M. & Miller, G. F. (1999) From pride and prejudice to persuasion: Satisficing in mate search. In G. Gigerenzer, P. M. Todd & the ABC Research Group (Eds.), Simple Heuristics That Make Us Smart (pp. 287-308). New York: Oxford University Press. |
URI: | https://mpra.ub.uni-muenchen.de/id/eprint/79448 |