Optimal play in coordination games requires estimating a partner's degree of recursion and one's certainty in that estimate¶

Claim · All claims
Evidence · 1 study · review r2 · q2
Currency · newest study 2012 · not yet checked against its sources · not reviewed by a person

Subclaims¶

q2 i? A computational account shows optimal stag-hunt responding depends on estimating the partner's recursion depth and one's certainty about that estimate. → Frith Chris D 2012

Evidence¶

Frith Chris D 2012¶

Frith Chris D. (2012). The role of metacognition in human social interactions. Philosophical Transactions of the Royal Society B: Biological Sciences. https://doi.org/10.1098/rstb.2012.0123

q2 · i? · review · r2

The review describes Yoshida et al.'s computational model (as cited) of the stag-hunt game, in which optimal responding is achieved by estimating the partner's degree of recursion from sequential choices. Certainty about this estimate is characterized as metacognitive knowledge.

"the two key parameters that you need to estimate for optimal play of this game are your partner's degree of recursion and your degree of certainty in this estimate."

Discussion¶

Related Claims¶

• Many learning algorithms, including neural network training and Q-learning, have recursive forms of the stochastic approximation type — related
• The group advantage reverses when partners' abilities differ greatly, and depends on the mode of communication — related