arXiv (All)
open access
When Are We Near Nash? Certifying Solutions in General-Sum Games
Heuristic solvers for general-sum extensive-form games produce a stream of iterates, and practice reports the NashGap of the returned profile. We ask what a solver can know about its own iterates from the regret accumulators and the terminal-distribution accumulators its updates already maintain. In
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Family_Winner: Integrating Game Theory and Heuristics to Provide Negotiation Support#203240
- Strategy-proof judgment aggregation#748775
- ✶ Induction - The Best Game in Town - Performance, Rule-Circularity, and the Pragmatic Vindication of Expectation#692101
- The problem of constrained judgment aggregation#748785
- Preference-based Cooperation in a Prisoner's Dilemma Game: Whole Population Cooperation without Information Flow across Matches#1276045
Record · ID 1413905
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive