Eureka Learning: Heuristics and response time in perfect information games

This paper investigates the possibility that people discover effective heuristics when playing similar perfect information games of varying complexity. We call this discovery experience Eureka Learning. We use a change-point analysis to identify 35 percent of our subjects as Eureka Learners.

[1]  A. Pettitt.  A Non‐Parametric Approach to the Change‐Point Problem , 1979 .

[2]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[3]  Paul Walker,et al.  Zermelo and the Early History of Game Theory , 2001, Games Econ. Behav..

[4]  C. Judd,et al.  The relation of special training and general intelligence , 1908 .

[5]  Martin Dufwenberg,et al.  Epiphany in the Game of 21 , 2010 .

[6]  John B. Van Huyck,et al.  Estimating bounded rationality and pricing performance uncertainty , 2007 .

[7]  N. Wilcox.  Lottery choice: incentives, complexity and decision time , 1993 .

[8]  John B. Van Huyck,et al.  Does seeing deeper into a game actually increase ones chances of winning , 2005 .

[9]  Teck-Hua Ho,et al.  Task complexity, equilibrium selection, and learning: an experimental study , 1996 .

[10]  Aldo Rustichini,et al.  Experience and insight in the Race game , 2010 .

[11]  E. Rowland.  Theory of Games and Economic Behavior , 1946, Nature.

[12]  C. L. Bouton.  Nim, A Game with a Complete Mathematical Theory , 1901 .

[13]  Christian Ewerhart,et al.  Chess-like Games Are Dominance Solvable in at Most Two Steps , 2000, Games Econ. Behav..

[14]  H. Simon,et al.  From substantive to procedural rationality , 1976 .

[15]  Daniel Serra,et al.  Do individuals use backward induction in dynamic optimization problems? An experimental investigation , 2001 .

[16]  L. Samuelson,et al.  Optimization Incentives and Coordination Failure in Laboratory Stag Hunt Games , 2001 .

[17]  Doron Sonsino,et al.  The Complexity Effects on Choice with Uncertainty - Experimental Evidence , 2002 .

[18]  P. B. Coaker,et al.  Applied Dynamic Programming , 1964 .

[19]  Eric J. Johnson,et al.  Detecting Failures of Backward Induction: Monitoring Information Search in Sequential Bargaining , 2002, J. Econ. Theory.

[20]  Anthony N. Pettitt,et al.  A simple cumulative sum type statistic for the change-point problem with zero-one observations , 1980 .

[21]  Does seeing more deeply into a game increase one’s chances of winning? , 2006 .

[22]  H. Simon,et al.  Expert chess memory: revisiting the chunking hypothesis. , 1998, Memory.