Minimizing Regret: The General Case

Abstract

In repeated games with differential information on one side, the labelling "general case" refers to games in which the action of the informed player is not known to the uninformed, who can only observe a signal which is the random outcome of his and his opponent's action. Here we consider the problem of minimizing regret (in the sense first formulated by Hannan [8]) when the information available is of this type. We give a simple condition describing the approachable set.Minimize regret;differential information;approachability