<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="en" article-type="article-commentary">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Games</journal-id>
<journal-title>Games</journal-title>
<issn pub-type="epub">2073-4336</issn>
<publisher>
<publisher-name>Molecular Diversity Preservation International (MDPI)</publisher-name></publisher></journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3390/g2020200</article-id>
<article-id pub-id-type="publisher-id">games-02-00200</article-id>
<article-categories>
<subj-group>
<subject>Commentary</subject></subj-group></article-categories>
<title-group>
<article-title>Market Entry Prediction Competition 2010</article-title></title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Hariskos</surname><given-names>Wasilios</given-names></name><xref ref-type="aff" rid="af1-games-02-00200"><sup>1</sup></xref><xref ref-type="corresp" rid="c1-games-02-00200"><sup>*</sup></xref></contrib>
<contrib contrib-type="author">
<name><surname>Leder</surname><given-names>Johannes</given-names></name><xref ref-type="aff" rid="af1-games-02-00200"><sup>1</sup></xref><xref ref-type="corresp" rid="c1-games-02-00200"><sup>*</sup></xref></contrib>
<contrib contrib-type="author">
<name><surname>Teodorescu</surname><given-names>Kinneret</given-names></name><xref ref-type="aff" rid="af2-games-02-00200"><sup>2</sup></xref><xref ref-type="corresp" rid="c1-games-02-00200"><sup>*</sup></xref></contrib></contrib-group>
<aff id="af1-games-02-00200">
<label>1</label> Center for Empirical Research in Economic and Behavioral Sciences (CEREB), University of Erfurt, 99089 Erfurt, Germany</aff>
<aff id="af2-games-02-00200">
<label>2</label> The Technion–Israel Institute of Technology, Haifa 32000, Israel</aff>
<author-notes>
<corresp id="c1-games-02-00200">
<label>*</label> Author to whom correspondence should be addressed; E-Mails: <email>wasilios.hariskos@uni-erfurt.de</email> (W.H.); <email>johannes.leder@uni-erfurt.de</email> (J.L.); <email>kinneret_w@yahoo.com</email> (K.T.)</corresp></author-notes>
<pub-date pub-type="collection">
<year>2011</year></pub-date>
<pub-date pub-type="epub">
<day>12</day>
<month>04</month>
<year>2011</year></pub-date>
<volume>2</volume>
<issue>2</issue>
<fpage>200</fpage>
<lpage>208</lpage>
<history>
<date date-type="received">
<day>18</day>
<month>01</month>
<year>2011</year></date>
<date date-type="rev-recd">
<day>30</day>
<month>03</month>
<year>2011</year></date>
<date date-type="accepted">
<day>07</day>
<month>04</month>
<year>2011</year></date></history>
<permissions>
<copyright-statement>© 2011 by the authors; licensee MDPI, Basel, Switzerland.</copyright-statement>
<copyright-year>2011</copyright-year>
<license>
<p>This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).</p></license></permissions>
<abstract>
<p>We submitted three models to the competition which were based on the I-SAW model. The models introduced four new assumptions. In the first model an adjustment process was introduced through which the tendency for exploration was higher at the beginning and decreased over time in the exploration stage. Another new assumption was that surprise as a factor influencing the weight of a trial in the sampling procedure was added. In the second model we added the possibility of an exclusion of unreliable experiences gained in the early trials of a game and the possibility of a revision of a reasonable alternative which was responsible for a very bad outcome in the previous trial. Three of the four added assumptions were combined in the third model. Because each of our models contains at least two new assumptions, we estimated the relative effect of each assumption on the estimation and prediction scores and carried out a test of robustness. In this way, we were able to clarify the usefulness of each added assumption.</p></abstract>
<kwd-group>
<kwd>learning</kwd>
<kwd>experience</kwd>
<kwd>I-SAW Model</kwd>
<kwd>market entry game</kwd></kwd-group></article-meta></front>
<body>
<sec sec-type="intro">
<label>1.</label>
<title>Introduction</title>
<p>We submitted three models to the market entry prediction competition 2010. All three models are based on the inertia, sampling and weighting (I-SAW) model which will be explained in Section 2. In Section 3 we describe the four additional assumptions we examined throughout the three models, which we present in Section 4. In Section 5 we discuss the relative effect of each added assumption. Lastly, in Section 6 we summarize the analysis results and the theoretical conclusions.</p></sec>
<sec>
<label>2.</label>
<title>Description of the Inertia, Sampling and Weighting (I-SAW) Model</title>
<p>Both the estimation experiment and the competition experiment are modeled as a series of <italic>M</italic> = 40 market entry games that are played by artificial agents. A market entry game <italic>G<sub>m</sub></italic> is characterized by different random values for its five parameters (<italic>k</italic>, <italic>H</italic>, <italic>pH</italic>, <italic>L</italic>, <italic>S</italic>). The I-SAW model [<xref ref-type="bibr" rid="b1-games-02-00200">1</xref>] generates for each market entry game <italic>G<sub>m</sub></italic> a group of <italic>N</italic> = 4 agents that play repeatedly for <italic>R</italic> = 50 trials. Each agent <italic>i</italic> is characterized by five traits whose values differ between agents and are distributed uniformly with <italic>ε<sub>i</sub></italic>∼<italic>U</italic>[0, .24], <italic>π<sub>i</sub></italic>∼<italic>U</italic>[0, 6], <italic>ω<sub>i</sub></italic>∼<italic>U</italic>[0, .8], <italic>ρ<sub>i</sub></italic>∼<italic>U</italic>[0, .2], and <italic>µ<sub>i</sub></italic>∼<italic>U</italic>{1, 2, 3}. All agents have the same action space <italic>A</italic> = {<italic>enter, not enter</italic>} and each agent <italic>i</italic> has to choose in each round <italic>t</italic> ∈ <italic>T</italic> = {1, … <italic>R</italic>} an action <italic>a<sub>i,t</sub> ∊ A</italic> without knowing how the other agents will decide.</p>
<p>The decision process of each agent <italic>i</italic> is divided into three stages: exploration, inertia, and exploitation. Exploration implies to enter the market with probability <italic>p<sup>enter</sup></italic> = 0.66 or otherwise not to enter. The probability for an agent to explore is given by
<disp-formula id="FD1">
<mml:math id="mm1" display="block">
<mml:semantics id="sm1">
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mtext mathvariant="italic">explore</mml:mtext></mml:mrow></mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mn>1</mml:mn></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub>
<mml:mo>∼</mml:mo>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mn>24</mml:mn></mml:mrow>
<mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&gt;</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>If an agent does not explore, then she enters the second stage. Inertia implies to repeat the last action <italic>a<sub>i,t</sub></italic> = <italic>a<sub>i,t</sub></italic><sub>−1</sub> with probability
<disp-formula id="FD2">
<mml:math id="mm2" display="block">
<mml:semantics id="sm2">
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mtext mathvariant="italic">inertia</mml:mtext></mml:mrow></mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mi>π</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mtext mathvariant="italic">Surprise</mml:mtext>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msubsup>
<mml:mo mathvariant="italic">∈</mml:mo>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>π</mml:mi>
<mml:mi>i</mml:mi></mml:msub>
<mml:mo>∼</mml:mo>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mn>6</mml:mn></mml:mrow>
<mml:mo stretchy="false">]</mml:mo></mml:mrow>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn></mml:mrow>
<mml:mo stretchy="false">]</mml:mo></mml:mrow>
<mml:mo>,</mml:mo>
<mml:mspace width="0.2em"/>
<mml:mtext>with</mml:mtext>
<mml:mspace width="0.2em"/>
<mml:msup>
<mml:mtext mathvariant="italic">Surprise</mml:mtext>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msup>
<mml:mspace width="0.2em"/>
<mml:mo mathvariant="italic">∈</mml:mo>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn></mml:mrow>
<mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>All agents that have neither entered the exploration stage nor have decided in the inertia stage to repeat their last action, make their decision in the exploitation stage. In this stage each agent chooses the action <italic>a<sub>i,t</sub> ∊ A</italic> with the highest estimated subjective value (ESV).</p>
<p>Given the set of payoffs for all past cases <italic>X</italic>(<italic>a<sub>i,past case</sub></italic>) = {<italic>x</italic>(<italic>a<sub>i</sub></italic><sub>,1</sub>), …, <italic>x</italic>(<italic>a<sub>i,t</sub></italic><sub>−1</sub>)} and the number of sample experiences or sample cases <italic>μ<sub>i</sub></italic>∼<italic>U</italic>{1, 2, 3}, the <italic>ESV</italic> of action <italic>a<sub>i,t</sub></italic> for an agent <italic>i</italic> is given by the sum of two terms: the average payoff from all past cases weighted by <italic>ω<sub>i</sub></italic>∼<italic>U</italic>[0, .8] and the average payoff from the set of sample cases {<italic>sample case</italic><sup>1</sup>, … <italic>sample case<sup>μ<sub>i</sub></sup></italic>} weighted by (1 – <italic>ω<sub>i</sub></italic>):
<disp-formula id="FD3">
<mml:math id="mm3" display="block">
<mml:semantics id="sm3">
<mml:mrow>
<mml:mtext mathvariant="italic">ESV</mml:mtext>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>ω</mml:mi>
<mml:mi>i</mml:mi></mml:msub>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mo>∑</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msubsup>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:mfrac>
<mml:mo>+</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>−</mml:mo>
<mml:msub>
<mml:mi>ω</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mo>∑</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>μ</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msubsup>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mtext mathvariant="italic">sample case</mml:mtext>
<mml:mi>l</mml:mi></mml:msup></mml:mrow></mml:msub></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>μ</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula>where the sampling procedure for any sample case <italic>l</italic> is given by: <italic>sample case<sup>l</sup></italic> = <italic>t</italic> − 1 with probability <italic>ρ<sub>i</sub></italic>∼<italic>U</italic>[0, .2] and otherwise <italic>sample case<sup>l</sup></italic>∼<italic>U</italic>{1, …, <italic>t</italic> − 1}.</p></sec>
<sec>
<label>3.</label>
<title>Description of the four Additional Assumptions and the three Models</title>
<sec>
<label>3.1.</label>
<title>Additional Assumption 1: The Adjustment of Exploration over Time</title>
<p>In the I-SAW model, the probability to explore 
<inline-formula>
<mml:math id="mm4" display="inline">
<mml:semantics id="sm4">
<mml:mrow>
<mml:msubsup>
<mml:mtext>p</mml:mtext>
<mml:mtext>i</mml:mtext>
<mml:mrow>
<mml:mtext>explore</mml:mtext></mml:mrow></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> equals ε<sub>i</sub> if t &gt; 1. The variable ε<sub>i</sub> differs between people, but is constant within a person throughout all trials of a game. However, it seems reasonable to assume that when faced with an unfamiliar environment, subjects will display higher explorative behavior at the beginning than after gaining some experience. As indicated by machine learning models, the change of exploration can be linear [<xref ref-type="bibr" rid="b2-games-02-00200">2</xref>-<xref ref-type="bibr" rid="b4-games-02-00200">4</xref>] or discontinuous by involving a switching point [<xref ref-type="bibr" rid="b5-games-02-00200">5</xref>]. Moreover, research on repeated choice, shows that people repeat their choices, <italic>i.e.</italic> develop routines, when they repeat similar decisions [<xref ref-type="bibr" rid="b6-games-02-00200">6</xref>]. A routine is described as a preference for a specific solution to a known problem. Thus, we introduced a higher exploration level at the beginning of the game and a decrease of exploration with increasing numbers of trials. The decrease is modeled in four steps:
<disp-formula id="FD4">
<mml:math id="mm5" display="block">
<mml:semantics id="sm5">
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mtext mathvariant="italic">explore</mml:mtext></mml:mrow></mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mn>1</mml:mn></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>6</mml:mn>
<mml:mo>∗</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow>
<mml:mo>/</mml:mo>
<mml:mi>t</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mn>9</mml:mn>
<mml:mo>∗</mml:mo>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&lt;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mn>6</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>5</mml:mn>
<mml:mo>&lt;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mn>31</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&gt;</mml:mo>
<mml:mn>30</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>Thus, the individual tendency to explore 
<inline-formula>
<mml:math id="mm6" display="inline">
<mml:semantics id="sm6">
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
<mml:mtext mathvariant="italic">explorer</mml:mtext></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> is not only a function of the trait <italic>ε<sub>i</sub></italic> of agent <italic>i</italic> but also a function of the level of experience. It therefore captures additionally the adjustment process to a new environment.</p></sec>
<sec>
<label>3.2.</label>
<title>Additional Assumption 2: The Recalling of Surprising Experiences</title>
<p>In the I-SAW model, when sampling (past) experiences, the most recent trial has a higher probability to be included in the sample due to the recency effect. All other past trials have the same probability to be sampled. However, studies concerning the von-Restorff-Effect [<xref ref-type="bibr" rid="b9-games-02-00200">9</xref>] suggest that not all past experiences are equally likely to be included in the sample of experiences. It was found that stimulus items that are distinct from the general item pool are more apt to be recalled [<xref ref-type="bibr" rid="b7-games-02-00200">7</xref>-<xref ref-type="bibr" rid="b9-games-02-00200">9</xref>]. Furthermore early research on animal learning and the disruptive effect of surprising events on memory recall, found that surprising events lead to a lower rate of recall of events subsequent to the surprising one [<xref ref-type="bibr" rid="b10-games-02-00200">10</xref>].Therefore, we propose the influence of surprise on the sampling process in the exploitation stage. If the surprise term of a given trial <italic>Surprise<sup>t</sup></italic><sup>−1</sup> exceeds a threshold of 0.85 (according to fitted data), the probability to sample this trial for the calculation of the ESV is increased. To take the underweighting of rare events in decisions from experience [<xref ref-type="bibr" rid="b11-games-02-00200">11</xref>,<xref ref-type="bibr" rid="b12-games-02-00200">12</xref>] into consideration we limited this property to the last very surprising trial. Since the recency effect is assumed to vary across individuals, as indicated by the <italic>ρ<sub>i</sub></italic> parameter in the I-SAW model, we chose to use this parameter in order to depict surprise about a trial for the sampling process. Therefore, the last very surprising trial, has a higher probability to be sampled, and its probability to be sampled depends on the individual tendency to recall the most recent trial <italic>ρ<sub>i</sub></italic>∼<italic>U</italic>[0, 0.2].</p></sec>
<sec>
<label>3.3.</label>
<title>Additional Assumption 3: The Possibility of an Exclusion of Very Early Trials from the Sample of Experiences</title>
<p>As previously noted, besides the most recent trial the sampling procedure of the I-SAW model assigns the same probability to be recalled to all other past trials. However, in the first trials of a new game, strategic uncertainty and uncertainty about the payoff rule is likely to be higher. Thus, early choices are more prone to randomness. This led us to the assumption, that later in the game, the participants should be more likely to question the reliability of the information gained through the very early trials of the game. In order to include this “doubt about experiences in very early trials” we introduced the following modification: Early experiences or cases are revised and can be excluded from the sample even if they are drawn at first during the sampling process. Revision implies that the agent repeats the sampling procedure for a given sample experience or sample case <italic>I</italic> if <italic>sample case<sup>l</sup></italic> &lt; 9 once, repeats it a second time if <italic>sample case<sup>l</sup></italic> &lt; 7, and again if <italic>sample case<sup>l</sup></italic> &lt; 5, and again if <italic>sample case<sup>l</sup></italic> &lt; 3. This stepwise revision of the sampling decisions implies that an earlier <italic>sample case<sup>l</sup></italic> is more likely excluded from the set of sample cases.</p></sec>
<sec>
<label>3.4.</label>
<title>Additional Assumption 4: The Influence of a Very Bad Experience in the Previous Trial</title>
<p>Imagine action a<sub>i,t</sub> = not enter has the higher <italic>ESV</italic> in trial <italic>t</italic>, but in the previous trial this choice led to a very bad experience. In the I-SAW model the agent would have chosen simply the action with the higher ESV which is “not enter”. In the I-SAW model the affective reaction caused by negative experiences is not captured. But decisions are not only influenced by probability, but also by affective information [<xref ref-type="bibr" rid="b14-games-02-00200">14</xref>-<xref ref-type="bibr" rid="b16-games-02-00200">16</xref>]. Thus, we introduced the assumption that the agent revises his/her choice, although it has a higher ESV, if he/she made a very bad experience with it in the previous trial. This means that agent i revises his/her action if one of the two following sets of conditions is true:
<disp-formula id="FD5">
<mml:math id="mm7" display="block">
<mml:semantics id="sm7">
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext mathvariant="italic">First</mml:mtext>
<mml:mo>,</mml:mo>
<mml:mspace width="0.2em"/>
<mml:mtext mathvariant="italic">if it is jointly true that</mml:mtext>
<mml:mspace width="0.2em"/>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">not enter</mml:mtext>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mo>&lt;</mml:mo>
<mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">enter</mml:mtext></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mo>&gt;</mml:mo>
<mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>∗</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">not enter</mml:mtext>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow>
<mml:mo>&gt;</mml:mo>
<mml:mo>−</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">enter</mml:mtext></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext mathvariant="italic">Second</mml:mtext>
<mml:mo>,</mml:mo>
<mml:mspace width="0.2em"/>
<mml:mtext mathvariant="italic">if it is jointly true that</mml:mtext>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">not enter</mml:mtext>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mo>&gt;</mml:mo>
<mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">enter</mml:mtext></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mo>&gt;</mml:mo>
<mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>∗</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">not enter</mml:mtext></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow>
<mml:mo>&lt;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>−</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:msub>
<mml:mo>=</mml:mo>
<mml:mtext mathvariant="italic">enter</mml:mtext></mml:mrow>
<mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula></p>
<p>Revision implies to choose a<sub>i,t</sub> = enter with probability λ<sub>i</sub>∼U[0,0.5] (a trait) and otherwise the action with the higher ESV a<sub>i,t</sub> = not enter. Note that the revision process is analogous if action a<italic><sub>i</sub></italic><sub>,</sub><italic><sub>t</sub></italic> = enter has the higher <italic>ESV</italic> in trial.</p></sec></sec>
<sec>
<label>4.</label>
<title>Description of Our Models and Their Performance in the Competition</title>
<sec>
<label>4.1.</label>
<title>Teodorescu et al. (2010)</title>
<p>The model of Teodorescu, Hariskos and Leder (2010) introduces two changes in the I-SAW model: First, the tendency for exploration is higher at the beginning and decreases over time in the exploration stage (3.1). Second, the last surprising trial is included with higher probability in the sampling of past cases in the exploitation stage (3.2). One of the main advantages of these suggested changes to the I-SAW model is that although it takes into account the changes of exploration over time and the effect of surprise on memory processes, it does not add any other traits than the ones estimated by the original I-SAW model.</p></sec>
<sec>
<label>4.2.</label>
<title>Hariskos et al. (2010)</title>
<p>The model of Hariskos, Leder and Teodorescu (2010) introduces two changes to the exploitation stage of the I-SAW model: First, very early trials are excluded with higher probability from the sample of experiences (3.3). Second, the affective reaction caused by negative experiences was addressed (3.4).</p></sec>
<sec>
<label>4.3.</label>
<title>Leder et al. (2010)</title>
<p>After simulating the first two models, we created a third model in which we integrated the decreasing tendency to explore with increasing numbers of trials (additional assumption 3.1), the doubt about the reliability of experiences in very early trials (additional assumption 3.2), and the revision of a reasonable alternative given an associated very bad experience in the previous trial (additional assumption 3.4). We kept all parameters other than a slight change in the function determining the tendency to explore as depicted below:
<disp-formula id="FD6">
<mml:math id="mm8" display="block">
<mml:semantics id="sm8">
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mtext mathvariant="italic">explore</mml:mtext></mml:mrow></mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mn>1</mml:mn></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>9</mml:mn>
<mml:mo>∗</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow>
<mml:mo>/</mml:mo>
<mml:mi>t</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>0.95</mml:mn>
<mml:mo>∗</mml:mo>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>0.9</mml:mn>
<mml:mo>∗</mml:mo>
<mml:msub>
<mml:mi>ε</mml:mi>
<mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow>
<mml:mspace width="0.2em"/>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mspace width="0.2em"/>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&lt;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mn>10</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>9</mml:mn>
<mml:mo>&lt;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mn>31</mml:mn></mml:mrow></mml:mtd></mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&gt;</mml:mo>
<mml:mn>30</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow>
<mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></disp-formula></p></sec>
<sec>
<label>4.4.</label>
<title>The Models' Performance</title>
<p><xref ref-type="table" rid="t1-games-02-00200">Table 1</xref> summarizes the performance of our three models relative to the I-SAW model, once for the data of the estimation set, and once for the data of the competition set. We used the Mean Squared Distance (MSD) criterion as a performance's measure (as was used in the competition). Specifically, MSD is the average squared distance between the prediction and the observed choice proportion (lower is better).</p>
<p>All three models yield a better fit for the data from the estimation set than the I-SAW model. The fit of the first model (3.1) was slightly better than the I-SAW model, and the fit of the other two models (3.2 and 3.3) were by far better. However, only the first model predicted the competition data set better than the I-SAW model. In the following section we will focus on this issue.</p></sec></sec>
<sec>
<label>5.</label>
<title>The Predictive Power of Each Additional Assumption</title>
<p>Because we added more than one assumption to the I-SAW model in each of our models, we cannot state the relative effect of each assumption individually. For this reason, we calculated the MSD scores after the competition by adding only one assumption to the I-SAW model (10,000 simulations) and summarized the relative effect of each assumption. The relative effect for the estimation and competition score is depicted in <xref ref-type="table" rid="t2-games-02-00200">Table 2</xref>.</p>
<p>As depicted, each of our additional assumptions improved the estimation score. The first three assumptions (3.1, 3.2, and 3.3) also improved the competition score. Whereas the fourth assumption (3.4), while leading to the largest improvement for the estimation set, impaired the competition score, this clearly indicates over-fitting. Thus, we can conclude that the additional fourth assumption is responsible for the poor predictive performance of our second and third models.</p>
<p>In order to examine whether the very small improvement that resulted from adding the first assumption (3.1) was not obtained by chance, we conducted an additional analysis. One simple prediction of the decreasing exploration assumption is that in problems in which the best reply is relatively stable across trials, best reply behaviors are expected to become more common as time advances. On the other hand, constant exploration rate, as assumed by the original I-SAW model, predicts that in these cases, the frequency of best reply behaviors will remain constant over all trials. Problems 3 and 8 satisfy the relatively stable best reply requirement, since in these problems about 95% of the experiences yielded better payoffs for entering than staying out (obtained greater than forgone payoffs for entering and <italic>vice versa</italic> for staying out). The following table shows the percentages of best reply behaviors to previous trials for the first 12 trials:</p>
<p><xref ref-type="table" rid="t3-games-02-00200">Table 3</xref> shows that the frequency of best reply behaviors increases with increasing numbers of trials, a result that cannot be explained by the original stable exploration assumption of the I-SAW model. Rather, these results can be captured by the assumption that the tendency to explore is higher in the first trials and decreases throughout the trials. Further support to the robustness of the decreasing exploration assumption can be found in the results of the following problem presented by Hochman and Erev (2007) [<xref ref-type="bibr" rid="b17-games-02-00200">17</xref>]. In an experiment using the clicking paradigm, subjects were asked to choose repeatedly between unlabeled keys on the computer screen. Pressing on one of the keys always resulted in a payoff of eight points and the other always resulted in a payoff of nine. As in the market entry game, after each trial subjects received information about the forgone payoff, in addition to their obtained payoff. The surprising result was that the proportion of choosing the clearly better option increased gradually during the first 10 trials before reaching 90%–100% in later trials (see Figure 4 in [<xref ref-type="bibr" rid="b17-games-02-00200">17</xref>]). Therefore, it seems that decreasing exploration over time is a robust phenomenon, even when collecting information actively is not needed and counterproductive.</p></sec>
<sec sec-type="conclusions">
<label>6.</label>
<title>Summary and Conclusions</title>
<p>In this paper, we examined four additional assumptions to the I-SAW model [<xref ref-type="bibr" rid="b1-games-02-00200">1</xref>]. The first assumption implies that the tendency for exploration is higher at the beginning and decreases over time in the exploration stage. Although it improved the predictions only slightly, we showed that this assumption appears to be robust, even beyond market entry games. The second assumption suggests that the last surprising trial needs to be included with higher probability in the sampling of past cases in the exploitation stage. This minor change consistently improved the predictions slightly, and is in line with the von-Restorff-Effect [<xref ref-type="bibr" rid="b7-games-02-00200">7</xref>-<xref ref-type="bibr" rid="b9-games-02-00200">9</xref>] as well as with animal research on the disruptive effect of surprising events on memory recall [<xref ref-type="bibr" rid="b10-games-02-00200">10</xref>]. In the third additional assumption, we proposed that very early trials are excluded with higher probability from the sample of experiences. We suggested that this can be a result of “doubt about experiences in very early trials”, though one can argue that it might result also from memory limitation. It is important to note, that this additional assumption yields a high relative effect in the competition and the estimation set, thus, we believe that future research should address its importance and its underling processes. The fourth assumption implies the revision of a reasonable alternative given an associated very bad experience in the previous trial. However, we did not find evidence to support this assumption; therefore, we concluded that the large improvement of the predictions for the estimated data set was the result of over fitting. We believe that the first three assumptions presented here address robust learning processes and are not only specific for market entry games. Future research is needed to determine the robustness and limitations of the above additional assumptions.</p></sec></body>
<back>
<sec sec-type="display-objects">
<title>Tables</title>
<table-wrap id="t1-games-02-00200" position="float">
<label>Table 1.</label>
<caption>
<p>The performance of our models relative to the baseline model.</p></caption>
<table frame="hsides" rules="rows">
<thead>
<tr>
<th align="left" valign="top"/>
<th align="left" valign="top"><bold>Estimation MSD Score</bold></th>
<th align="left" valign="top"><bold>Relative Effect</bold></th>
<th align="left" valign="top"><bold>Competition MSD Score</bold></th>
<th align="left" valign="top"><bold>Relative Effect</bold></th></tr></thead>
<tbody>
<tr>
<td align="left" valign="top">I-SAW Model (2)</td>
<td align="left" valign="top">1.38</td>
<td align="left" valign="top"/>
<td align="left" valign="top">1.1749</td>
<td align="left" valign="top"/></tr>
<tr>
<td align="left" valign="top">Teodorescu <italic>et al.</italic> (4.1)</td>
<td align="left" valign="top">1.3507</td>
<td align="left" valign="top">−2.12%</td>
<td align="left" valign="top">1.16</td>
<td align="left" valign="top">−1.27%</td></tr>
<tr>
<td align="left" valign="top">Hariskos <italic>et al.</italic> (4.2)</td>
<td align="left" valign="top">1.1546</td>
<td align="left" valign="top">−16.33%</td>
<td align="left" valign="top">1.2197</td>
<td align="left" valign="top">3.81%</td></tr>
<tr>
<td align="left" valign="top">Leder <italic>et al.</italic> (4.3)</td>
<td align="left" valign="top">1.1546</td>
<td align="left" valign="top">−16.07%</td>
<td align="left" valign="top">1.1932</td>
<td align="left" valign="top">1.56%</td></tr></tbody></table></table-wrap>
<table-wrap id="t2-games-02-00200" position="float">
<label>Table 2.</label>
<caption>
<p>The relative effect of each assumption on the estimation and competition score.</p></caption>
<table frame="hsides" rules="rows">
<thead>
<tr>
<th align="left" valign="top"/>
<th align="left" valign="top"><bold>Estimation MSD Score</bold></th>
<th align="left" valign="top"><bold>Relative Effect</bold></th>
<th align="left" valign="top"><bold>Competition MSD Score</bold></th>
<th align="left" valign="top"><bold>Relative Effect</bold></th></tr></thead>
<tbody>
<tr>
<td align="left" valign="top">I-SAW Model (2)</td>
<td align="left" valign="top">1.38</td>
<td align="left" valign="top"/>
<td align="left" valign="top">1.1749</td>
<td align="left" valign="top"/></tr>
<tr>
<td align="left" valign="top">Exploration Over Time (3.1)</td>
<td align="left" valign="top">1.3485</td>
<td align="left" valign="top">−2.28%</td>
<td align="left" valign="top">1.1738</td>
<td align="left" valign="top">−0.09%</td></tr>
<tr>
<td align="left" valign="top">Surprising Experiences (3.2)</td>
<td align="left" valign="top">1.3496</td>
<td align="left" valign="top">−2.20%</td>
<td align="left" valign="top">1.1617</td>
<td align="left" valign="top">−1.12%</td></tr>
<tr>
<td align="left" valign="top">Very Early Trials (3.3)</td>
<td align="left" valign="top">1.2791</td>
<td align="left" valign="top">−7.31%</td>
<td align="left" valign="top">1.1375</td>
<td align="left" valign="top">−3.18%</td></tr>
<tr>
<td align="left" valign="top">Bad Experience in the Previous Trial (3.4)</td>
<td align="left" valign="top">1.2312</td>
<td align="left" valign="top">−10.78%</td>
<td align="left" valign="top">1.2486</td>
<td align="left" valign="top">6.27%</td></tr></tbody></table></table-wrap>
<table-wrap id="t3-games-02-00200" position="float">
<label>Table 3.</label>
<caption>
<p>Percentage of best reply behavior to previous trials for trial 1–12.</p></caption>
<table frame="hsides" rules="rows">
<thead>
<tr>
<th align="center" valign="middle"><bold>Trial</bold></th>
<th align="center" valign="middle"><bold>Percentage of best reply behavior to previous trials</bold></th></tr></thead>
<tbody>
<tr>
<td align="center" valign="top">2</td>
<td align="center" valign="top">75.0%</td></tr>
<tr>
<td align="center" valign="top">4</td>
<td align="center" valign="top">73.3%</td></tr>
<tr>
<td align="center" valign="top">6</td>
<td align="center" valign="top">86.7%</td></tr>
<tr>
<td align="center" valign="top">8</td>
<td align="center" valign="top">86.7%</td></tr>
<tr>
<td align="center" valign="top">10</td>
<td align="center" valign="top">91.7%</td></tr>
<tr>
<td align="center" valign="top">12</td>
<td align="center" valign="top">90.0%</td></tr></tbody></table></table-wrap></sec>
<ref-list>
<title>References and Notes</title>
<ref id="b1-games-02-00200"><label>1.</label><citation citation-type="book"><person-group person-group-type="author"><name><surname>Nevo</surname><given-names>I.</given-names></name><name><surname>Erev</surname><given-names>I.</given-names></name></person-group><source>On surprise, change, and the effect of recent outcomes</source><publisher-name>Technion</publisher-name><publisher-loc>Haifa, Israel</publisher-loc><year>2010</year><comment>(unpublished work)</comment></citation></ref>
<ref id="b2-games-02-00200"><label>2.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Crook</surname><given-names>P.</given-names></name><name><surname>Hayes</surname><given-names>G.</given-names></name></person-group><article-title>Learning in a state of confusion: Perceptual aliasing in grid world navigation</article-title><conf-name>Proceedings of the 4th British Conference on (Mobile) Robotics: Towards Intelligent Mobile Robots</conf-name><conf-loc>UWE, Bristol</conf-loc><year>2003</year></citation></ref>
<ref id="b3-games-02-00200"><label>3.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>De Croon</surname><given-names>G.</given-names></name><name><surname>van Dartel</surname><given-names>M.F.</given-names></name><name><surname>Posta</surname><given-names>E.O.</given-names></name></person-group><article-title>Evolutionary Learning Outperforms Reinforcement Learning on Non-Markovian Tasks</article-title><conf-name>Proceedings of the 8th European Conference on Artificial Life, Workshop on Memory and Learning Mechanisms in Autonomous Robots</conf-name><conf-loc>Canterbury, UK</conf-loc><year>2005</year></citation></ref>
<ref id="b4-games-02-00200"><label>4.</label><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Loch</surname><given-names>J.</given-names></name><name><surname>Singh</surname><given-names>S.P.</given-names></name></person-group><article-title>Using eligibility traces to find the best memoryless policy in partially observable Markov decision processes (ICML-98)</article-title><conf-name>Proceedings of the 15th International Conference on Machine Learning, Madison</conf-name><conf-loc>WI, USA</conf-loc><year>1998</year><fpage>323</fpage><lpage>331</lpage></citation></ref>
<ref id="b5-games-02-00200"><label>5.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname><given-names>M.D.</given-names></name><name><surname>Zhang</surname><given-names>S.</given-names></name><name><surname>Munro</surname><given-names>M.N.</given-names></name><name><surname>Steyvers</surname><given-names>M.</given-names></name></person-group><article-title>Psychological models of human and optimal performance on bandit problems</article-title><source>Cogn. Syst. Res.</source><comment>(in press)</comment></citation></ref>
<ref id="b6-games-02-00200"><label>6.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Betsch</surname><given-names>T.</given-names></name><name><surname>Haberstroh</surname><given-names>S.</given-names></name><name><surname>Glöckner</surname><given-names>A.</given-names></name><name><surname>Haar</surname><given-names>T.</given-names></name><name><surname>Fiedler</surname><given-names>K.</given-names></name></person-group><article-title>The effects of routine strengths on adaption and information search in recurrent decision making</article-title><source>Organ. Behav. Hum. Decision Proc.</source><year>2001</year><volume>84</volume><fpage>23</fpage><lpage>53</lpage><pub-id pub-id-type="doi">10.1006/obhd.2000.2916</pub-id></citation></ref>
<ref id="b7-games-02-00200"><label>7.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Green</surname><given-names>R.T.</given-names></name></person-group><article-title>Surprise as a factor in the Von Restorff Effect</article-title><source>J. Exp. Psychol.</source><year>1956</year><volume>52</volume><fpage>340</fpage><lpage>344</lpage><pub-id pub-id-type="doi">10.1037/h0047496</pub-id><pub-id pub-id-type="pmid">13367361</pub-id></citation></ref>
<ref id="b8-games-02-00200"><label>8.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hunt</surname><given-names>R.R.</given-names></name><name><surname>Lamb</surname><given-names>C.A.</given-names></name></person-group><article-title>What causes the Isolation Effect?</article-title><source>J. Exp. Psychol.-Learn. Mem. Cogn.</source><year>2001</year><volume>27</volume><fpage>1359</fpage><lpage>1366</lpage><pub-id pub-id-type="doi">10.1037/0278-7393.27.6.1359</pub-id><pub-id pub-id-type="pmid">11713872</pub-id></citation></ref>
<ref id="b9-games-02-00200"><label>9.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Von Restorff</surname><given-names>H.</given-names></name></person-group><article-title>Über die Wirkung von Bereichsbildungen im Spurenfeld (The effects of field formation in the trace field)</article-title><source>Psychologie Forschung</source><year>1933</year><volume>18</volume><fpage>299</fpage><lpage>342</lpage><pub-id pub-id-type="doi">10.1007/BF02409636</pub-id></citation></ref>
<ref id="b10-games-02-00200"><label>10.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tulving</surname><given-names>E.</given-names></name></person-group><article-title>Retrograde amnesia in free recall</article-title><source>Science</source><year>1969</year><volume>164</volume><fpage>88</fpage><lpage>90</lpage><pub-id pub-id-type="doi">10.1126/science.164.3875.88</pub-id><pub-id pub-id-type="pmid">5773720</pub-id></citation></ref>
<ref id="b11-games-02-00200"><label>11.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Barron</surname><given-names>G.</given-names></name><name><surname>Erev</surname><given-names>I.</given-names></name></person-group><article-title>Small Feedback-based decisions and their limited correspondence to description-based decisions</article-title><source>J. Behav. Decis. Making</source><year>2003</year><volume>16</volume><fpage>215</fpage><lpage>233</lpage><pub-id pub-id-type="doi">10.1002/bdm.443</pub-id></citation></ref>
<ref id="b12-games-02-00200"><label>12.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hertwig</surname><given-names>R.</given-names></name><name><surname>Barron</surname><given-names>G.</given-names></name><name><surname>Weber</surname><given-names>E.U.</given-names></name><name><surname>Erev</surname><given-names>I.</given-names></name></person-group><article-title>Decisions from experience and the effect of rare events in risky choices</article-title><source>Psychol. Sci.</source><year>2004</year><volume>15</volume><fpage>534</fpage><lpage>539</lpage><pub-id pub-id-type="doi">10.1111/j.0956-7976.2004.00715.x</pub-id><pub-id pub-id-type="pmid">15270998</pub-id></citation></ref>
<ref id="b13-games-02-00200"><label>13.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hochmann</surname><given-names>G.</given-names></name><name><surname>Ayal</surname><given-names>S.</given-names></name><name><surname>Glöckner</surname><given-names>A.</given-names></name></person-group><article-title>Physiological arousal in processing recognition information: Ignoring or integrating cognitive cues?</article-title><source>Judgment Decis. Making</source><year>2010</year><volume>5</volume><fpage>285</fpage><lpage>299</lpage></citation></ref>
<ref id="b14-games-02-00200"><label>14.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Loewenstein</surname><given-names>G.F.</given-names></name><name><surname>Weber</surname><given-names>E.U.</given-names></name><name><surname>Hsee</surname><given-names>C.</given-names></name><name><surname>Welch</surname><given-names>N.</given-names></name></person-group><article-title>Risk as feelings</article-title><source>Psychol. Bull.</source><year>2001</year><volume>127</volume><fpage>267</fpage><lpage>286</lpage><pub-id pub-id-type="doi">10.1037/0033-2909.127.2.267</pub-id><pub-id pub-id-type="pmid">11316014</pub-id></citation></ref>
<ref id="b15-games-02-00200"><label>15.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rottenstreich</surname><given-names>Y.</given-names></name><name><surname>Hsee</surname><given-names>C.K.</given-names></name></person-group><article-title>Money, kisses, and electric shocks: On the affective psychology of risk</article-title><source>Psychol. Sci.</source><year>2001</year><volume>12</volume><fpage>185</fpage><lpage>190</lpage><pub-id pub-id-type="doi">10.1111/1467-9280.00334</pub-id><pub-id pub-id-type="pmid">11437299</pub-id></citation></ref>
<ref id="b16-games-02-00200"><label>16.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Glöckner</surname><given-names>A.</given-names></name><name><surname>Hochmann</surname><given-names>G.</given-names></name></person-group><article-title>The interplay of experience-based affective and probabilistic cues in decision making</article-title><source>Exp. Psychol.</source><year>2011</year><volume>58</volume><fpage>132</fpage><lpage>141</lpage><pub-id pub-id-type="doi">10.1027/1618-3169/a000078</pub-id><pub-id pub-id-type="pmid">20705548</pub-id></citation></ref>
<ref id="b17-games-02-00200"><label>17.</label><citation citation-type="web"><person-group person-group-type="author"><name><surname>Erev</surname><given-names>I.</given-names></name><name><surname>Haruvy</surname><given-names>E.</given-names></name></person-group><article-title>Learning and the economics of small decisions</article-title><source>The Handbook of Experimental Economics</source><person-group person-group-type="editor"><name><surname>Kagel</surname><given-names>J.H.</given-names></name><name><surname>Roth</surname><given-names>A.E.</given-names></name></person-group><publisher-name>Princeton University Press</publisher-name><publisher-loc>Princeton, NJ, USA</publisher-loc><year>2009</year><comment>Available online: <ext-link xlink:href="http://www.unitn.it/files/download/11452/learningchapter.pdf" ext-link-type="uri">http://www.unitn.it/files/download/11452/learningchapter.pdf</ext-link> (accessed on June 2009)</comment></citation></ref></ref-list></back></article>
