A note on Kuhn's Theorem with ambiguity averse players

摘要

Kuhn's Theorem shows that extensive games with perfect recall can equivalently be analyzed using mixed or behavioral strategies, as long as players are expected utility maximizers. This note constructs an example that illustrates the limits of Kuhn's Theorem in an environment with ambiguity averse players who use a maxmin decision rule and full Bayesian updating.