arXiv (All)
open access
Variational Contraction Conditions for Iterative Algorithms in Multi-Population Discrete-Time Regularized Mean-Field Games
In this work, we study the contraction conditions of iterative algorithms for stationary and finite-horizon discrete-time regularized mean-field games (MFGs) with multiple populations, where each population only interacts with the state distributions of the other populations. Due to the high dimensi
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
- Horizon-Independent Contraction for Continuous-Time Discounted Regularized Mean-Field Games#781020
- Horizon-Independent Contraction for Continuous-Time Discounted Regularized Mean-Field Games#779645
- Stochastic optimisation method for estimating large deviations#1050647
- Evolution of noisy learning in games.#213904
- Non-Adaptive 1-Bit Mean Estimation: Minimax Rates and the Sample-Interval Tradeoff#985906
Record · ID 925160
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