Mate Choice Mechanism for Solving a Quasi-Dilemma
Saijo, Okano, and Yamakawa (2014) showed that the mate choice mechanism for a symmetric prisoner's dilemma (PD) game implements cooperation in backward elimination of weakly dominated strategies (BEWDS), and it attained almost full cooperation in their experiment. First, this study shows that the mechanism works well in the class of quasi-dilemma (QD) games such as asymmetric PD games and coordination games. Second, the class of BEWDS- implementable games is exactly the same as the class of QD games. Third, the mechanism cannot implement cooperation in a subgame perfect equilibrium. Finally, we confirm that the mate choice mechanism works well experimentally for an asymmetric PD game.
Research Center for Social Design Engineering,
Kochi University of Technology
Research Institute for Economics and Business Administration,
Rokkodai-cho, Nada-ku, Kobe
School of Economics, Shanghai University, China