arXiv (All)
open access
ABRA: An algorithm which cannot converge to low-quality Nash equilibria
We consider a game theoretic approach to solve multi-agent coordination problems with submodular objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal. A recent work further shows that the equilibria which achieve this wors
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
- Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies#10306
- When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance#1037252
- Multiagent negotiation for fair and unbiased resource allocation#499558
- Probably Approximately Correct Nash Equilibrium Learning#1000425
- A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games#1050734
Record · ID 999567
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