2 citations · 4 across the 8 of their papers we have counts for
6 papers · 1 filter
Approximating Combinatorial Contracts with Arbitrary Costs
Xiaotie Deng, Hanyu Li, Chenghua Liu
We study single-agent combinatorial contracts under linear payments. Under a reward share , an agent chooses a subset of hidden actions, generating reward …
Cardinality-Constrained Randomized Assortments with Balanced Market Share
Xiaotie Deng, Hanyu Li, Chenghua Liu
Assortment optimization asks a seller which of products to display to each customer. Under the multinomial-logit (MNL) model, a revenue-maximizing policy may concentrate most p…
Will AI Trade? A Computational Inversion of the No-Trade Theorem
Hanyu Li, Xiaotie Deng
Classic no-trade theorems attribute trade to heterogeneous beliefs. We re-examine this conclusion for AI agents, asking if trade can arise from computational limitations, under com…
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…
A survey on algorithms for Nash equilibria in finite normal-form games
Hanyu Li, Wenhan Huang, Zhijian Duan +4
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing deman…
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…