PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games. - Paul W. Goldberg; Matthew J. Katzman (SAGT, 2022)

Lower bounds for the query complexity of equilibria in Lipschitz games. - Paul W. Goldberg; Matthew J. Katzman (Theor. Comput. Sci., 2023)

PPAD-complete approximate pure Nash equilibria in Lipschitz games. - Paul W. Goldberg; Matthew J. Katzman (Theor. Comput. Sci., 2023)