Homological Barriers to Stable Learning of First-Order Nash Equilibria
cs.GT, cs.LG
Submitted: 2026-11-08
Updated: 2026-11-08
Terminology
Sources
- Improved Hardness Results for Min-Max Optimization with Coupled Constraints
- The Complexity of Min-Max Optimization with Product Constraints
- On the Complexity of Learning Nash Equilibria
- The Complexity of Min-Max Optimization for Quadratic Polynomials
Related papers
- How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
- Effective Horizons for Prophet Inequalities with Discounted I.I.D. Rewards
- Truthful-in-Expectation Mechanism with Constant Maximin-Share Guarantee
- The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets
- From signaling to interviews in random matching markets
- Optimizing Social Utility in Sequential Experiments