arXiv (All)
open access
Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games
We propose networked policy gradient play for solving Markov potential games with continuous and/or discrete state-action pairs. During the game, agents use parametrized and differentiable policies that depend on the current state and the policy parameters of other agents. During training, agents up
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
- ART for Diffusion Sampling: Continuous-Time Control and Actor-Critic Learning#332550
- Towards Shutdownable Agents via Stochastic Choice#76620
- Thompson Sampling for Infinite-Horizon Discounted Decision Processes#1049572
- RLinf-USER: A Unified and Extensible System for Real-World Online Policy Learning in Embodied AI#798763
- RLinf-USER: A Unified and Extensible System for Real-World Online Policy Learning in Embodied AI#797349
Record · ID 1035271
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