An experiment on Lowest Unique Integer Games
An experiment on Lowest Unique Integer Games
复制标题
DOI:
10.1016/j.physa.2016.06.108
复制
发表时间:
2016-12-01
影响因子:
3.3
通讯作者:
Hanaki,Nobuyuki
中科院分区:
文献类型:
--
作者:
Yamada,Takashi;Hanaki,Nobuyuki
Abstract We experimentally study Lowest Unique Integer Games (LUIGs) to determine if and how subjects self-organize into different behavioral classes. In a LUIG, N (≥ 3) players submit a positive integer up to M and the player choosing the smallest number not chosen by anyone else wins. LUIGs are simplified versions of real systems such as Lowest/Highest Unique Bid Auctions that have been attracting attention from scholars, yet experimental studies are scarce. Furthermore, LUIGs offer insights into choice patterns that can shed light on the alleviation of congestion problems. Here, we consider four LUIGs with N={3, 4} and M={3, 4}. We find that (a) choices made by more than 1/3 of subjects were not significantly different from what a symmetric mixed-strategy Nash equilibrium (MSE) predicts; however,(b) subjects who behaved significantly differently from what the MSE predicts won the game more frequently. What distinguishes subjects was their tendencies to change their choices following losses.