United We Fall: On the Nash Equilibria of Multiplex and Multilayer Network Games

Network games provide a framework to study strategic decision-making processes that are governed by structured interdependencies among agents. However, existing models do not account for environments in which agents simultaneously interact over multiple networks, or when agents operate over multiple action dimensions. In this article, we propose new models of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">multiplex</i> network games to capture the different modalities of interactions among strategic agents, and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">multilayer</i> network games to capture their interactions over multiple action dimensions. We explore how the properties of the constituent networks of a multiplex/multilayer network can undermine or support the existence, uniqueness, and stability of the game's Nash equilibria. Notably, we highlight that both the largest and smallest eigenvalues of the constituent networks (reflecting their connectivity and two-sidedness, respectively) are instrumental in determining the uniqueness of the multiplex/multilayer network game's equilibrium. Together, our findings shed light on the reasons for the fragility of equilibria when agents interact over networks of networks, and point out potential interventions to alleviate them.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Control of Network Systems
Published
2025-02-04
DOI
https://doi.org/10.1109/tcns.2025.3538753
Citations
2
Primary Topic
Game Theory and Applications
Type
article
Field-Weighted Citation Impact
4.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

United We Fall: On the Nash Equilibria of Multiplex and Multilayer Network Games

Parinaz Naghizadeh, Raman Ebrahimi
2 citations
IEEE Transactions on Control of Network Systems
Game Theory and Applications
4.21
article

United We Fall: On the Nash Equilibria of Multiplex and Multilayer Network Games

Parinaz Naghizadeh, Raman Ebrahimi
article en
2 citations

Abstract

Network games provide a framework to study strategic decision-making processes that are governed by structured interdependencies among agents. However, existing models do not account for environments in which agents simultaneously interact over multiple networks, or when agents operate over multiple action dimensions. In this article, we propose new models of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">multiplex</i> network games to capture the different modalities of interactions among strategic agents, and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">multilayer</i> network games to capture their interactions over multiple action dimensions. We explore how the properties of the constituent networks of a multiplex/multilayer network can undermine or support the existence, uniqueness, and stability of the game's Nash equilibria. Notably, we highlight that both the largest and smallest eigenvalues of the constituent networks (reflecting their connectivity and two-sidedness, respectively) are instrumental in determining the uniqueness of the multiplex/multilayer network game's equilibrium. Together, our findings shed light on the reasons for the fragility of equilibria when agents interact over networks of networks, and point out potential interventions to alleviate them.

IEEE Transactions on Control of Network SystemsVol. 12(2)
University of California San Diego (US)
Openalex Percentile: Top 8%
Game Theory and Applications
4.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.