Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
DGX agentarXiv:2508.11874v2 Announce Type: replace-cross Abstract: Designing polynomial-time algorithms for approximate Nash equilibria (ANE) with provable worst-case guarantees is a fundamental open problem i