In coordination games, the distinctive presence of multiple equilibria poses a challenge to coordination, and this has led over time to the proposal of numerous determinants of the latter. In this paper, we study coordination in a repeated Stag-hunt game played by two agents who are able to learn from the outcomes of each game, but do not know the payoff matrix. By modulating their learning capabilities, we show that agents are able to coordinate on the social optimum when they learn slowly from experience and are prone to making mistakes. A comparison with the results from a recent laboratory experiment is also provided.
Inefficient Learning Leads to Efficient Coordination: A Repeated Stag-Hunt Game with Learning Agents / Manfredi R., Vilone D., Cvetkovic T.J., Bagnoli F., Guazzini A.. - In: GAMES. - ISSN 2073-4336. - ELETTRONICO. - 17:(2026), pp. 39.0-39.0. [10.3390/g17040039]
Inefficient Learning Leads to Efficient Coordination: A Repeated Stag-Hunt Game with Learning Agents
Manfredi R.Membro del Collaboration Group
;Cvetkovic T. J.Membro del Collaboration Group
;Bagnoli F.Membro del Collaboration Group
;Guazzini A.Membro del Collaboration Group
2026
Abstract
In coordination games, the distinctive presence of multiple equilibria poses a challenge to coordination, and this has led over time to the proposal of numerous determinants of the latter. In this paper, we study coordination in a repeated Stag-hunt game played by two agents who are able to learn from the outcomes of each game, but do not know the payoff matrix. By modulating their learning capabilities, we show that agents are able to coordinate on the social optimum when they learn slowly from experience and are prone to making mistakes. A comparison with the results from a recent laboratory experiment is also provided.| File | Dimensione | Formato | |
|---|---|---|---|
|
Manfredi et al - Inefficient-games-17-00039.pdf
accesso aperto
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Open Access
Dimensione
5.34 MB
Formato
Adobe PDF
|
5.34 MB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



