Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/79029
題名: Is genetic programming "human-competitive"? The case of experimental double auction markets
作者: Shu-Heng, Chen.;Kuo-Chuan, Shih
陳樹衡;施國銓
貢獻者: 經濟學系
關鍵詞: Best strategy; Cognitive psychology; Double auction; Experimental markets; Human subjects; Human-Competitiveness; Learning performance; Optimal solutions; Two stage; Working memories; Autonomous agents; Commerce; Competition; Integer programming; Genetic programming
日期: 九月-2011
上傳時間: 23-十月-2015
摘要: In this paper, the performance of human subjects is compared with genetic programming in trading. Within a kind of double auction market, we compare the learning performance between human subjects and autonomous agents whose trading behavior is driven by genetic programming (GP). To this end, a learning index based upon the optimal solution to a double auction market problem, characterized as integer programming, is developed, and criteria tailor-made for humans are proposed to evaluate the performance of both human subjects and software agents. It is found that GP robots generally fail to discover the best strategy, which is a two-stage procrastination strategy, but some human subjects are able to do so. An analysis from the point of view of cognitive psychology further shows that the minority who were able to find this best strategy tend to have higher working memory capacities than the majority who failed to do so. Therefore, even though GP can outperform most human subjects, it is not "human-competitive" from a higher standard. © 2011 Springer-Verlag.
關聯: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
資料類型: conference
DOI: http://dx.doi.org/10.1007/978-3-642-23878-9_15
Appears in Collections:會議論文

Files in This Item:
File Description SizeFormat
index.html176 BHTML2View/Open
Show full item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.