1 paper
Hanyu Li, Dongchen Li, Xiaotie Deng
Designing polynomial-time algorithms for approximate Nash equilibria (ANE) with provable worst-case guarantees is a fundamental open problem in algorithmic game theory. While large…