Menus: A Framework for Learning Against Strategic Opponents

No-swap-regret algorithms are converge upon as an “optimal” commitment strategy for robust learning against a strategic opponent and principled generalizations of no-swap-regret beyond normal-form games are identified that preserve the same strategic guarantees while remaining computationally tractable.