When Are We Near Nash? Certifying Solutions in General-Sum Games

cs.GT, cs.AI, cs.MA

Submitted: 2026-10-21

Updated: 2026-10-21

Comments: 35 pages, 5 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Related papers

• Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
• In-Context Credit Assignment via the Core
• Optimal Regret for Online Market Making with Limit Order Book
• Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
• Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
• Adversarial procurement in blockchains