A learning algorithm for the finite-time two-armed bandit problem

A simple algorithm for the finite-time two-armed bandit problem is proposed. In this algorithm, the whole process is divided into the first estimating process and the next controlling process. Efficient methods by using approximation for computing the optimal length of the estimating process are provided.