2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.GT2025
Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
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…
cs.GT2023★ 2 cited
The Search-and-Mix Paradigm in Approximate Nash Equilibrium Algorithms
Xiaotie Deng, Dongchen Li, Hanyu Li
AI in Math deals with mathematics in a constructive manner so that reasoning becomes automated, less laborious, and less error-prone. For algorithms, the question becomes how to au…