arXiv (All)
open access
Robust PAC Learning of Concurrent Stochastic Games
We introduce the first Probably Approximately Correct (PAC) learning framework for general-sum concurrent stochastic games (CSGs) with transition uncertainty, while addressing the challenge of Nash equilibrium (NE) existence. Our algorithm maintains data-driven $L^1$ confidence sets over transition
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
- Comparison of Deterministic Information Providers#1012871
- Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits#1052033
- Adaptive Policy Portfolios for Robust Markov Decision Processes#463258
- Testing for Monotone Equilibrium Strategies in Games of Incomplete Information#1049800
Record · ID 927052
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