Hongkai Zhao - Simple and Efficient Iterative Strategies for Mean-Field Games - IPAM at UCLA
Recorded 27 February 2026. Hongkai Zhao of Duke University presents "Simple and Efficient Iterative Strategies for Mean-Field Games" at IPAM's Mathematics of Cancer: Open Mathematical Problems Workshop.Abstract: The mean-field game (MFG) studies the Nash equilibrium of a non-cooperative game involving a continuum of players, with many applications in economics, epidemics, crowd motion, data science, and more. In an MFG, each player seeks to optimize a strategy that minimizes their individual cost in response to a given state distribution of the entire player population. The individual best strategies collectively shape a new state distribution of the population, and the equilibrium of an MFG is the fixed point of this interaction. However, simple fixed-point iterations do not always guarantee convergence. Fictitious play is a very simple iterative algorithm that leverages a best-response mapping combined with a weighted average of the best response and previous responses. In this talk, I will first present a simple and unified convergence analysis with an explicit convergence rate for the fictitious play algorithm in MFGs of general types, especially non-potential MFGs. Based on this analysis, we propose several numerical strategies to accelerate fictitious play. Then, I will present a simple and effective iterative strategy, Equilibrium Correction Iteration (ECI), to solve a class of inverse MFG problems, where simple Nash equilibrium state measurements can be used to infer the unknown ambient potential, such as obstacles.
Learn more online at: https://www.ipam.ucla.edu/programs/workshops/mathematics-of-cancer-open-mathematical-problems/ Receive SMS online on sms24.me
TubeReader video aggregator is a website that collects and organizes online videos from the YouTube source. Video aggregation is done for different purposes, and TubeReader take different approaches to achieve their purpose.
Our try to collect videos of high quality or interest for visitors to view; the collection may be made by editors or may be based on community votes.
Another method is to base the collection on those videos most viewed, either at the aggregator site or at various popular video hosting sites.
TubeReader site exists to allow users to collect their own sets of videos, for personal use as well as for browsing and viewing by others; TubeReader can develop online communities around video sharing.
Our site allow users to create a personalized video playlist, for personal use as well as for browsing and viewing by others.
@YouTubeReaderBot allows you to subscribe to Youtube channels.
By using @YouTubeReaderBot Bot you agree with YouTube Terms of Service.
Use the @YouTubeReaderBot telegram bot to be the first to be notified when new videos are released on your favorite channels.
Look for new videos or channels and share them with your friends.
You can start using our bot from this video, subscribe now to Hongkai Zhao - Simple and Efficient Iterative Strategies for Mean-Field Games - IPAM at UCLA
What is YouTube?
YouTube is a free video sharing website that makes it easy to watch online videos. You can even create and upload your own videos to share with others. Originally created in 2005, YouTube is now one of the most popular sites on the Web, with visitors watching around 6 billion hours of video every month.
![FEATURE: John Shuster vs. Scott Dunnam - Draw M7 - USA Curling National Championships [C]](https://img.youtube.com/vi/XfWpKnhAz-4/maxresdefault.jpg)