arXiv (All)
open access
Limit-sure Winning in Team Games without Shared Randomness
We study concurrent stochastic games in which a team of agents plays against an adversarial environment. If the agents could access a shared source of randomness, then these games reduce to two-player games. Despite being common in the literature on coalition games, this assumption does not accurate
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
- Dicey games: Shared sources of randomness in distributed systems#449044
- Learning to Report Unsafe Tasks in a Multi-Agent Game#1233041
- Categorization and correlation in a random-matching game#1276439
- Square-Root Regret for Adversarial Multiplayer Bandits without Collision Information or Shared Randomness#1201701
- Probably approximately correct stability of allocations in uncertain coalitional games with private sampling#1000449
Record · ID 1297921
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