Horizon-Independent Contraction for Continuous-Time Discounted Regularized Mean-Field Games
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.
[2608.27723] Horizon-Independent Contraction for Continuous-Time Discounted Regularized Mean-Field Games Skip to main content Search Submit Donate Log in Computer Science > Computer Science and Game Theory arXiv:2608.27723 (cs) [Submitted on 27 Aug 2026] Title: Horizon-Independent Contraction for Continuous-Time Discounted Regularized Mean-Field Games Authors: Junji Yan , Uğur Aydın , Tamer Başar View PDF HTML (experimental) Abstract: We study contraction properties of non-stationary continuous-time mean-field games (MFGs) under discounting and entropy regularization. The state of the representative agent evolves according to a controlled continuous-time Markov chain, and both the state and action spaces are finite. In contrast to the undiscounted case, we show that, under a sufficiently large discount rate, finite-horizon MFGs admit a horizon-independent contraction condition, which also coincides with the corresponding infinite-horizon non-stationary contraction condition. As a byproduct, we obtain an explicit convergence rate between finite- and infinite-horizon mean-field equilibria. For each finite horizon, we further derive a refined contraction criterion from the spectral radius of a positive operator that majorizes the propagation of policy errors, and show that its large-horizon limit agrees with the horizon-independent contraction factor. Finally, we provide an explicit error bound between discounted and undiscounted finite-horizon regularized equilibria. Comments: 34 pages. Full version including complete proofs Subjects: Computer Science and Game Theory (cs.GT) ; Systems and Control (eess.SY); Optimization and Control (math.OC) Cite as: arXiv:2608.27723 [cs.GT] (or arXiv:2608.27723v1 [cs.GT] for this version) https://doi.org/10.48550/arXiv.2608.27723 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Junji Yan [ view email ] [v1] Thu, 27 Aug 2026 21:29:40 UTC (39 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.GT < prev | next > new | recent | 2026-08 Change to browse by: cs cs.SY eess eess.SY math math.OC References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Related documents
- Horizon-Independent Contraction for Continuous-Time Discounted Regularized Mean-Field Games#779645
- Decoding a mean field game by the Cauchy data around its unknown stationary states#997916
- Variational Contraction Conditions for Iterative Algorithms in Multi-Population Discrete-Time Regularized Mean-Field Games#925160
- Convex Order and Moment Persuasion#1071459
- Joint Lower Bounds for Zeroth-Order Nonconvex Optimization on Euclidean Balls#1154898
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive