Many strategies exist which provide an approximate solution to the bandit problem, and can be put into the four broad categories detailed below.
Epsilon-greedy strategy:[REF] The best lever is selected for a proportion 1 - \epsilon of the trials, and a lever is selected at random (with uniform probability) for a proportion \epsilon.