Computational Model Library

This release is out-of-date. The latest version is 1.1.0

Asymmetric two-sided matching (version 1.0.0)

Peter Todd tried 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.
In this model his model is extended to the asymmetric setting where two parties have the different number of agents. Therefore, the search rule and the learning mechanism for two parties differ. Through the simulation, the search rules and the learning mechanisms which were identified to be appropriate in symmetric setting are revealed to be inappropriate in asymmetric setting. The reason why they are inappropriate is discussed.

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

Download Version 1.0.0
Version Submitter First published Last modified Status
1.1.0 Naoki Shiba Tue May 28 08:44:50 2013 Tue May 28 08:44:50 2013 Published
1.0.0 Naoki Shiba Wed Jan 9 09:45:46 2013 Sat Apr 27 20:18:23 2013 Published


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.