共 26 条
Individual evolutionary learning in repeated beauty contest games
被引:4
作者:
Anufriev, Mikhail
[1
,2
]
Duffy, John
[3
,4
]
Panchenko, Valentyn
[5
]
机构:
[1] Univ Technol Sydney, Dept Econ, Sydney, Australia
[2] Tech Univ Ostrava, Fac Econ, Dept Finance, Ostrava, Czech Republic
[3] Univ Calif Irvine, Dept Econ, Irvine, CA USA
[4] Osaka Univ, ISER, Suita, Japan
[5] Univ New South Wales, UNSW Business Sch, Econ, Sydney, Australia
基金:
澳大利亚研究理事会;
关键词:
Beauty contest game;
Learning;
Evolutionary dynamics;
Testbed;
Agent-based model;
GENETIC ALGORITHM;
BEHAVIOR;
FEEDBACK;
D O I:
10.1016/j.jebo.2023.12.010
中图分类号:
F [经济];
学科分类号:
02 ;
摘要:
The Individual Evolutionary Learning (IEL) algorithm was proposed as a portable learning model for games with large strategy spaces. In principle, IEL benchmark simulations could substitute or supplement expensive experiments with human subjects. We evaluate the ability of the IEL model to replicate experimental findings observed in repeated Keynesian Beauty Contest (KBC) games, which have a large strategy space. The IEL specification with standard parameter values is able to capture major dynamical features and differences between treatments in both one-dimensional (Nagel, 1995; Duffy and Nagel, 1997) and two-dimensional (Anufriev et al., 2022b) versions of KBC games. We compare IEL with some other simple learning models and find that it performs relatively better across multiple treatments. We also use IEL to predict behavior in repeated KBC games that have not yet been conducted experimentally.
引用
收藏
页码:550 / 567
页数:18
相关论文