all AI news
Learning in Discounted-cost and Average-cost Mean-field Games. (arXiv:1912.13309v3 [eess.SY] UPDATED)
Nov. 11, 2022, 2:12 a.m. | Berkay Anahtarcı, Can Deha Karıksız, Naci Saldi
cs.LG updates on arXiv.org arxiv.org
We consider learning approximate Nash equilibria for discrete-time mean-field
games with nonlinear stochastic state dynamics subject to both average and
discounted costs. To this end, we introduce a mean-field equilibrium (MFE)
operator, whose fixed point is a mean-field equilibrium (i.e. equilibrium in
the infinite population limit). We first prove that this operator is a
contraction, and propose a learning algorithm to compute an approximate
mean-field equilibrium by approximating the MFE operator with a random one.
Moreover, using the contraction property …
More from arxiv.org / cs.LG updates on arXiv.org
A Single-Loop Algorithm for Decentralized Bilevel Optimization
1 day, 6 hours ago |
arxiv.org
CLEANing Cygnus A deep and fast with R2D2
1 day, 6 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Alternant Data Engineering
@ Aspire Software | Angers, FR
Senior Software Engineer, Generative AI
@ Google | Dublin, Ireland