Natural Invariant Measures for Chaotic Game Dynamics: Finding Order in Chaos

📅 2026-07-23
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This study addresses the challenge that multiplicative weights update algorithms in games often fail to converge to Nash equilibria and exhibit unpredictable long-term behavior due to Li-Yorke chaos. To overcome this, we introduce for the first time the natural invariant measure from ergodic theory into the analysis of game dynamics. This framework not only characterizes strategy frequencies but also precisely computes long-run time averages of economically relevant observables—such as payoffs, social cost, and regret—even in the absence of pointwise convergence. Focusing on two-strategy congestion games, we rigorously establish that the system retains statistical predictability and provide a unified description of its full dynamical spectrum, ranging from periodic attractors to coexisting chaotic regimes, thereby revealing the algorithm’s capacity to replicate canonical behaviors of one-dimensional dynamical systems.
📝 Abstract
We study the long-term behavior of the Multiplicative Weights Update (MWU) algorithm in game settings where learning dynamics frequently fail to converge to Nash equilibria and instead exhibit Li-Yorke chaos. While such chaos precludes the prediction of specific long-term strategy profiles, it does not imply a lack of statistical structure. We demonstrate that natural invariant measures - a fundamental concept from ergodic theory - provide the rigorous framework necessary to find order within this chaos. Focusing on a two-strategy congestion game, we prove that these measures allow for a comprehensive statistical characterization of the dynamics. Crucially, we show that this framework extends beyond simple strategy frequencies to \emph{general observables}, enabling the precise calculation of long-term time averages for broad classes of economic metrics - including payoffs, social cost, and regret - despite chaos. Our results reveal that this simple learning algorithm captures the full spectrum of behaviors found in one-dimensional dynamical systems, from unique or multiple absolutely continuous invariant measures to complex periodic attractors as well as coexisting chaotic and stable (periodic) behaviors. By bridging game theory and dynamical systems, we show that statistical predictability is attainable even in the absence of pointwise convergence.
Problem

Research questions and friction points this paper is trying to address.

chaos
invariant measures
game dynamics
statistical predictability
Multiplicative Weights Update
Innovation

Methods, ideas, or system contributions that make the work stand out.

natural invariant measures
Multiplicative Weights Update
Li-Yorke chaos
ergodic theory
statistical predictability
🔎 Similar Papers
No similar papers found.
J
Jakub Bielawski
Department of Mathematics, Krakow University of Economics, Rakowicka 27, 31-510 Kraków, Poland
Thiparat Chotibut
Thiparat Chotibut
Assistant Professor of Physics, Chulalongkorn University
Statistical MechanicsMachine LearningQuantum InformationQuantum Machine Learning
Fryderyk Falniowski
Fryderyk Falniowski
Krakow University of Economics
Game TheoryDynamical Systems
M
Michał Misiurewicz
Department of Mathematical Sciences, Indiana University Indianapolis, 402 N. Blackford Street, Indianapolis, Indiana 46202, USA
Georgios Piliouras
Georgios Piliouras
Google DeepMind, Singapore University of Technology and Design
Algorithmic Game TheoryMachine LearningEconomicsBlockchain