g-Forcing Strategy

A multi-armed bandit strategy proposed by Cowan and Katehakis. By setting a non-decreasing, divergent exploration schedule g(t) whose increments tend to zero, it forces a lower bound on the sampling of each arm, while greedily selecting the arm with the highest empirical mean in the remaining rounds. It has a scale-free property.