Hierarchical games under uncertainty

Hierarchical game of two players is considered. It is supposed that the leader has incomplete information about follower’s interests. The maximum guaranteed payoff of the leader is calculated. An alternative definition of the maximum guaranteed payoff is suggested, which is shown to be equivalent to the classical one. It is used to reduce the problem of maximum guaranteed payoff simple transformations of predicate calculus expressions.