Computational Model Library

Symmetric two-sided matching (version 1.1.0)

Peter Todd conducted a simulation for two-sided matching problem in symmetric setting in 1999. In his model there are the same number of agents in two parties, each of whom has his/her own mate value. Each agent in both parties tries to find his/her mate in the other party based on his/her candidate’s mate value and his/her own aspiration level for the partner’s mate values. Each agent learns his/her own mate value and adjusts his/her aspiration level through the trial period (adolescence). Todd tried a several search rules and the learning mechanisms. The rules and the mechanisms are symmetric for both parties in this setting. This NetLogo model is a replication of his model.

Peter M. Todd and Geoffery F. Miller, “From pride and prejudice to persuasion”, in Gred Gigerenzer, Peter M. Todd and the ABC Research Group, Simple heuristics that makes us smart, Oxford University Press, New York, 1999

Release Notes

No release notes entered with this release.
Version Submitter First published Last modified Status
1.1.0 Naoki Shiba Wed May 29 06:17:25 2013 Wed May 29 06:17:25 2013 Published
1.0.0 Naoki Shiba Wed Jan 9 09:40:54 2013 Sat Apr 27 20:18:48 2013 Published

Discussion

Download
This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.