tions, not just those in the policy</p></li>
</ul>
</li>
<li><p><em>bandit</em> problems - determining exploration policy</p>
<ul>
<li><p><em>n-armed bandit</em> - pulling n levelers on a slot machine, each with different distr.</p></li>
<li><p><em>Gittins index</em> - function of number of pulls / payoff</p></li>
</ul>
</li>
<li><p>coorect schemes should be <em>GLIE</em> - greedy in the limit of infinite exploration - visits all states infinitely, but eventually become greedy</p></li>
</ul>
<section id="ag