Fryderyk Falniowski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fryderyk Falniowski has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jakub Bielawski
Department of Mathematics, Krakow University of Economics, Krakow, Poland
7 shared publications - Thiparat Chotibut
Chulalongkorn University
6 shared publications - Georgios Piliouras
Google DeepMind, London, United Kingdom
5 shared publications - Michał Misiurewicz
Department of Mathematical Sciences, Indiana University-Purdue University Indianapolis, 402 N. Blackford Street, Indianapolis, IN 46202, USA
5 shared publications - Dominik Kwietniak
Jagiellonian University in Kraków
4 shared publications Marcin Jakubek
Institute of Economics, Polish Academy of Sciences
3 shared publications
Latest Publications
- 11 September 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Bifurcation and Chaos
- Vol. 36 (16)
Strange Bifurcation Diagrams
We investigate a family of one-dimensional maps for which the bifurcation diagrams look differently than the usual ones. We describe and exemplify various unique and interesting phenomena arising from this family of maps.
- 11 September 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Bifurcation and Chaos
- Vol. 36 (16)
Strange Bifurcation Diagrams
We investigate a family of one-dimensional maps for which the bifurcation diagrams look differently than the usual ones. We describe and exemplify various unique and interesting phenomena arising from this family of maps.
- Open Access
Diversity in Schumpeterian games
We examine the impact of a change in diversity introduced by a new product on the evolution of an economic system. Modeling Schumpeterian competition as a population game with a unique, attracting, evolutionarily stable state (the Schumpeterian state), in which both innovators and imitators coexist, we examine how the Schumpeterian state evolves depending on the properties of the new product developed by innovators. This way, we demonstrate that the change in diversity is one of the spiritus movens of innovation, influencing the process of creative destruction.
Open AccessDiversity in Schumpeterian games
We examine the impact of a change in diversity introduced by a new product on the evolution of an economic system. Modeling Schumpeterian competition as a population game with a unique, attracting, evolutionarily stable state (the Schumpeterian state), in which both innovators and imitators coexist, we examine how the Schumpeterian state evolves depending on the properties of the new product developed by innovators. This way, we demonstrate that the change in diversity is one of the spiritus movens of innovation, influencing the process of creative destruction.
- Open Access
- 4 July 2025
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 15 (4) , 1363
Correction: The Emergence of Chaos in Population Game Dynamics Induced by Comparisons
- 4 July 2025
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 15 (4) , 1363
Open AccessCorrection: The Emergence of Chaos in Population Game Dynamics Induced by Comparisons
- Open Access
- 16 June 2025
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 122 (25)
Heterogeneity, reinforcement learning, and chaos in population games
Inspired by the challenges at the intersection of Evolutionary Game Theory and Machine Learning, we investigate a class of discrete-time multiagent reinforcement learning (MARL) dynamics in population/nonatomic congestion games, where agents have diverse beliefs and learn at different rates. These congestion games, a well-studied class of potential games, are characterized by individual agents having negligible effects on system performance, strongly aligned incentives, and well-understood advantageous properties of Nash equilibria. Despite the presence of static Nash equilibria, we demonstrate that MARL dynamics with heterogeneous learning rates can deviate from these equilibria, exhibiting instability and even chaotic behavior and resulting in increased social costs. Remarkably, even within these chaotic regimes, we show that the time-averaged macroscopic behavior converges to exact Nash equilibria, thus linking the microscopic dynamic complexity with traditional equilibrium concepts. By employing dynamical systems techniques, we analyze the interaction between individual-level adaptation and population-level outcomes, paving the way for studying heterogeneous learning dynamics in discrete time across more complex game scenarios.
- 16 June 2025
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 122 (25)
Open AccessHeterogeneity, reinforcement learning, and chaos in population games
Inspired by the challenges at the intersection of Evolutionary Game Theory and Machine Learning, we investigate a class of discrete-time multiagent reinforcement learning (MARL) dynamics in population/nonatomic congestion games, where agents have diverse beliefs and learn at different rates. These congestion games, a well-studied class of potential games, are characterized by individual agents having negligible effects on system performance, strongly aligned incentives, and well-understood advantageous properties of Nash equilibria. Despite the presence of static Nash equilibria, we demonstrate that MARL dynamics with heterogeneous learning rates can deviate from these equilibria, exhibiting instability and even chaotic behavior and resulting in increased social costs. Remarkably, even within these chaotic regimes, we show that the time-averaged macroscopic behavior converges to exact Nash equilibria, thus linking the microscopic dynamic complexity with traditional equilibrium concepts. By employing dynamical systems techniques, we analyze the interaction between individual-level adaptation and population-level outcomes, paving the way for studying heterogeneous learning dynamics in discrete time across more complex game scenarios.
- Open Access
- 2 June 2025
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 15 (4) , 1317-1362
The Emergence of Chaos in Population Game Dynamics Induced by Comparisons
Precise description of population game dynamics introduced by revision protocols—an economic model describing the agent’s propensity to switch to a better-performing strategy—is of importance in economics and social sciences in general. In this setting imitation of others and innovation are forces which drive the evolution of the economic system. As the continuous-time game dynamics is relatively well understood, the same cannot be said about revision driven dynamics in the discrete time. We investigate the behavior of agents using revision protocols in a $$2\times 2$$ anti-coordination game with symmetric random matching and a unique mixed Nash equilibrium. We show that in discrete time one can construct a revision protocol (either innovative or imitative) such that if a large enough fraction of agents revise their choices the game dynamics becomes Li-Yorke chaotic, inducing complex and unpredictable behavior of the system, precluding stable predictions of equilibrium. This is in stark contrast to the continuous case. Moreover, we reveal that this unpredictability is encoded in any imitative revision protocol. Furthermore, we show that for any such game there exists a perturbed pairwise proportional imitation protocol introducing chaotic behavior of agents when a sufficiently large part of the population reconsiders their strategies.- 2 June 2025
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 15 (4) , 1317-1362
Open AccessThe Emergence of Chaos in Population Game Dynamics Induced by Comparisons
Precise description of population game dynamics introduced by revision protocols—an economic model describing the agent’s propensity to switch to a better-performing strategy—is of importance in economics and social sciences in general. In this setting imitation of others and innovation are forces which drive the evolution of the economic system. As the continuous-time game dynamics is relatively well understood, the same cannot be said about revision driven dynamics in the discrete time. We investigate the behavior of agents using revision protocols in a $$2\times 2$$ anti-coordination game with symmetric random matching and a unique mixed Nash equilibrium. We show that in discrete time one can construct a revision protocol (either innovative or imitative) such that if a large enough fraction of agents revise their choices the game dynamics becomes Li-Yorke chaotic, inducing complex and unpredictable behavior of the system, precluding stable predictions of equilibrium. This is in stark contrast to the continuous case. Moreover, we reveal that this unpredictability is encoded in any imitative revision protocol. Furthermore, we show that for any such game there exists a perturbed pairwise proportional imitation protocol introducing chaotic behavior of agents when a sufficiently large part of the population reconsiders their strategies. - 27 February 2025
- Published by Springer Nature in International Journal of Game Theory
- Vol. 54 (1) , 1-29
On the discrete-time origins of the replicator dynamics: from convergence to instability and chaos
- 27 February 2025
- Published by Springer Nature in International Journal of Game Theory
- Vol. 54 (1) , 1-29
On the discrete-time origins of the replicator dynamics: from convergence to instability and chaos
- Open Access
Interval maps mimicking circle rotations
We investigate the dynamics of maps of the real line whose behavior on an invariant interval is close to a rational rotation on the circle. We concentrate on a specific two-parameter family, describing the dynamics arising from models in game theory, mathematical biology and machine learning. If one parameter is a rational number, $k/n$, with $k,n$ coprime, and the second one is large enough, we prove that there is a periodic orbit of period $n$. It behaves like an orbit of the circle rotation by an angle $2πk/n$ and attracts trajectories of Lebesgue almost all starting points. We also discover numerically other interesting phenomena. While we do not give rigorous proofs for them, we provide convincing explanations.Open AccessInterval maps mimicking circle rotations
We investigate the dynamics of maps of the real line whose behavior on an invariant interval is close to a rational rotation on the circle. We concentrate on a specific two-parameter family, describing the dynamics arising from models in game theory, mathematical biology and machine learning. If one parameter is a rational number, $k/n$, with $k,n$ coprime, and the second one is large enough, we prove that there is a periodic orbit of period $n$. It behaves like an orbit of the circle rotation by an angle $2πk/n$ and attracts trajectories of Lebesgue almost all starting points. We also discover numerically other interesting phenomena. While we do not give rigorous proofs for them, we provide convincing explanations. - Open Access
On the discrete-time origins of the replicator dynamics: From convergence to instability and chaos
We consider three distinct discrete-time models of learning and evolution in games: a biological model based on intra-species selective pressure, the dynamics induced by pairwise proportional imitation, and the exponential / multiplicative weights (EW) algorithm for online learning. Even though these models share the same continuous-time limit - the replicator dynamics - we show that second-order effects play a crucial role and may lead to drastically different behaviors in each model, even in very simple, symmetric $2\times2$ games. Specifically, we study the resulting discrete-time dynamics in a class of parametrized congestion games, and we show that (i) in the biological model of intra-species competition, the dynamics remain convergent for any parameter value; (ii) the dynamics of pairwise proportional imitation exhibit an entire range of behaviors for larger time steps and different equilibrium configurations (stability, instability, and even Li-Yorke chaos); while (iii) in the EW algorithm, increasing the time step (almost) inevitably leads to chaos (again, in the formal, Li-Yorke sense). This divergence of behaviors comes in stark contrast to the globally convergent behavior of the replicator dynamics, and serves to delineate the extent to which the replicator dynamics provide a useful predictor for the long-run behavior of their discrete-time origins.Open AccessOn the discrete-time origins of the replicator dynamics: From convergence to instability and chaos
We consider three distinct discrete-time models of learning and evolution in games: a biological model based on intra-species selective pressure, the dynamics induced by pairwise proportional imitation, and the exponential / multiplicative weights (EW) algorithm for online learning. Even though these models share the same continuous-time limit - the replicator dynamics - we show that second-order effects play a crucial role and may lead to drastically different behaviors in each model, even in very simple, symmetric $2\times2$ games. Specifically, we study the resulting discrete-time dynamics in a class of parametrized congestion games, and we show that (i) in the biological model of intra-species competition, the dynamics remain convergent for any parameter value; (ii) the dynamics of pairwise proportional imitation exhibit an entire range of behaviors for larger time steps and different equilibrium configurations (stability, instability, and even Li-Yorke chaos); while (iii) in the EW algorithm, increasing the time step (almost) inevitably leads to chaos (again, in the formal, Li-Yorke sense). This divergence of behaviors comes in stark contrast to the globally convergent behavior of the replicator dynamics, and serves to delineate the extent to which the replicator dynamics provide a useful predictor for the long-run behavior of their discrete-time origins. - Open Access
- 1 January 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (1)
Memory loss can prevent chaos in games dynamics
Recent studies have raised concerns on the inevitability of chaos in congestion games with large learning rates. We further investigate this phenomenon by exploring the learning dynamics in simple two-resource congestion games, where a continuum of agents learns according to a simplified experience-weighted attraction algorithm. The model is characterized by three key parameters: a population intensity of choice (learning rate), a discount factor (recency bias or exploration parameter), and the cost function asymmetry. The intensity of choice captures agents’ economic rationality in their tendency to approximately best respond to the other agent’s behavior. The discount factor captures a type of memory loss of agents, where past outcomes matter exponentially less than the recent ones. Our main findings reveal that while increasing the intensity of choice destabilizes the system for any discount factor, whether the resulting dynamics remains predictable or becomes unpredictable and chaotic depends on both the memory loss and the cost asymmetry. As memory loss increases, the chaotic regime gives place to a periodic orbit of period 2 that is globally attracting except for a countable set of points that lead to the equilibrium. Therefore, memory loss can suppress chaotic behaviors. The results highlight the crucial role of memory loss in mitigating chaos and promoting predictable outcomes in congestion games, providing insights into designing control strategies in resource allocation systems susceptible to chaotic behaviors.
- 1 January 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (1)
Open AccessMemory loss can prevent chaos in games dynamics
Recent studies have raised concerns on the inevitability of chaos in congestion games with large learning rates. We further investigate this phenomenon by exploring the learning dynamics in simple two-resource congestion games, where a continuum of agents learns according to a simplified experience-weighted attraction algorithm. The model is characterized by three key parameters: a population intensity of choice (learning rate), a discount factor (recency bias or exploration parameter), and the cost function asymmetry. The intensity of choice captures agents’ economic rationality in their tendency to approximately best respond to the other agent’s behavior. The discount factor captures a type of memory loss of agents, where past outcomes matter exponentially less than the recent ones. Our main findings reveal that while increasing the intensity of choice destabilizes the system for any discount factor, whether the resulting dynamics remains predictable or becomes unpredictable and chaotic depends on both the memory loss and the cost asymmetry. As memory loss increases, the chaotic regime gives place to a periodic orbit of period 2 that is globally attracting except for a countable set of points that lead to the equilibrium. Therefore, memory loss can suppress chaotic behaviors. The results highlight the crucial role of memory loss in mitigating chaos and promoting predictable outcomes in congestion games, providing insights into designing control strategies in resource allocation systems susceptible to chaotic behaviors.
- 17 August 2020
- Published by Taylor & Francis in Dynamical Systems
- Vol. 36 (1) , 48-63
Family of chaotic maps from game theory
From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to itself. Interesting dynamics arise on the invariant diagonal, on which a two-parameter family of bimodal interval maps exhibits periodic orbits and chaos. While the fixed point b corresponding to a Nash equilibrium of such map f is usually repelling, it is globally Cesàro attracting on the diagonal, that is, for every . This solves a known open question whether there exists a “natural” nontrivial smooth map other than with centers of mass of all periodic orbits coinciding. We also study the dependence of the dynamics on the two parameters.- 17 August 2020
- Published by Taylor & Francis in Dynamical Systems
- Vol. 36 (1) , 48-63
Family of chaotic maps from game theory
From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to itself. Interesting dynamics arise on the invariant diagonal, on which a two-parameter family of bimodal interval maps exhibits periodic orbits and chaos. While the fixed point b corresponding to a Nash equilibrium of such map f is usually repelling, it is globally Cesàro attracting on the diagonal, that is, for every . This solves a known open question whether there exists a “natural” nontrivial smooth map other than with centers of mass of all periodic orbits coinciding. We also study the dependence of the dynamics on the two parameters.