Coevolutionary networks of reinforcement-learning agents
Ardeshir Kianercy, Aram Galstyan

TL;DR
This paper models the coevolution of network structures and strategies in repeated games using reinforcement learning, revealing stable network motifs and the impact of exploration rates on equilibrium stability.
Contribution
It introduces a coupled replicator equation framework for analyzing coevolutionary dynamics in multi-agent networks with reinforcement learning.
Findings
Stable equilibria are star motifs without exploration.
Agents play pure strategies at equilibrium, even with mixed NE.
A critical exploration rate stabilizes symmetric network topologies.
Abstract
This paper presents a model of network formation in repeated games where the players adapt their strategies and network ties simultaneously using a simple reinforcement-learning scheme. It is demonstrated that the coevolutionary dynamics of such systems can be described via coupled replicator equations. We provide a comprehensive analysis for three-player two-action games, which is the minimum system size with nontrivial structural dynamics. In particular, we characterize the Nash equilibria (NE) in such games and examine the local stability of the rest points corresponding to those equilibria. We also study general n-player networks via both simulations and analytical methods and find that in the absence of exploration, the stable equilibria consist of star motifs as the main building blocks of the network. Furthermore, in all stable equilibria the agents play pure strategies, even…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
