The weak aggregating algorithm and weak mixability

This paper resolves the problem of predicting as well as the best expert up to an additive term o(n), where n is the length of a sequence of letters from a finite alphabet. For the bounded games the paper introduces the Weak Aggregating Algorithm that allows us to obtain additive terms of the form C√n. A modification of the Weak Aggregating Algorithm that covers unbounded games is also described.