  Hedge has been proposed as an adaptive scheme, which guides an agent's
decision in resource selection and distribution problems that can be modeled as
a multi-armed bandit full information game. Such problems are encountered in
the areas of computer and communication networks, e.g. network path selection,
load distribution, network interdiction, and also in problems in the area of
transportation. We study Hedge under the assumption that the total loss that
can be suffered by the player in each round is upper bounded. In this paper, we
study the worst performance of Hedge.
