Keep pulling the thread on Noam Brown.
Computing certain regularized equilibria in two-player zero-sum games can be treated as perfect-information problems because they do not possess the non-correspondence problem found with Nash equilibria.
Using regularized equilibria yields a simplified framework for decision-time planning in two-player zero-sum games that avoids the unappealing properties of existing approaches.
A naive application of public policy announcements fails for two-player zero-sum games because the resulting Nash equilibria may not correspond to the Nash equilibria of the original game.
Regularized equilibria in two-player zero-sum games can be made arbitrarily close to Nash equilibria.