arXiv (All)
open access
Toward Online Robust Zero-Sum Markov Games with Function Approximation
Online robust zero-sum Markov games pose a coupled operator-learning and game-solving problem: from nominal interaction data, the learner must recover a worst-case minimax Bellman operator while maintaining strategic coverage and controlling stage-game approximation error. Existing robust reinforcem
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
- $Q$ Can Play That Game: Online Fitted $Q$-Iteration for Continuous-Action Zero-Sum Markov Games with Convex-Concave Function Approximation#1199284
- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes#1161031
- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes#1157479
- Bellman Error Minimization Via Linear Programming Normalization#1187044
- Q-Learning for Reachability in MEC-Free MDPs#1157052
Record · ID 1401462
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