When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff?

We study the relationship between a player's lowest equilibrium payoff in a repeated game with imperfect monitoring and this player's minmax payoff in the corresponding one-shot game. We characterize the signal structures under which these two payoffs coincide for any payoff matrix. Under an identifiability assumption, we further show that, if the monitoring structure of an infinitely repeated game "nearly" satisfies this condition, then these two payoffs are approximately equal, independently of the discount factor. This provides conditions under which existing folk theorems exactly characterize the limiting payoff set.