Agent intelligence involves specific requirements for social attributes. Intelligent agents make their decisions based on the groups they are part of, tend to satisfy co-members, and enlarge their own benefits. A fundamental question is whether this form of subgroup decision-making accommodate each individual’s preferences. In this paper, we examine the evolution of an anticoordination game on a higher-order network in the form of a simplicial complex in relation to the facet cover problem, which ensures that each subgroup yields a positive benefit. We introduce and apply the facet update rule to regulate nodes’ group-based interactions. We identify the payoff parameter condition that a strict Nash equilibrium (SNE) satisfies a facet cover. The proposed facet update rule enables the activated facet to reach a facet equilibrium, and all nodes would converge to an SNE with no more than 2m strategy switches, where m is the number of nodes in the simplicial complex. Additionally, we analyze the convergence of the asynchronous update rule, which can be seen as a special case of the facet update rule. Our simulations and extensive examples reveal that the SNE achieved by the facet update rule, on average, covers fewer nodes compared to the asynchronous update rule.
Skip Nav Destination
Article navigation
October 2024
Research Article|
October 24 2024
Equilibrium seeking of higher-order networks under facet cover constraints
Special Collection:
Intelligent Game on Networked Systems: Optimization, Evolution and Control
Shaoyuan Niu
;
Shaoyuan Niu
a)
(Writing – original draft, Writing – review & editing)
School of Electronic and Information Engineering, Tongji University
, Shanghai 201804, China
Search for other works by this author on:
Xiang Li
Xiang Li
b)
(Writing – original draft, Writing – review & editing)
School of Electronic and Information Engineering, Tongji University
, Shanghai 201804, China
b)Author to whom correspondence should be addressed: lix2021@tongji.edu.cn
Search for other works by this author on:
b)Author to whom correspondence should be addressed: lix2021@tongji.edu.cn
a)
Electronic mail: sy_niu_tongji@tongji.edu.cn
Chaos 34, 103145 (2024)
Article history
Received:
May 06 2024
Accepted:
October 04 2024
Citation
Shaoyuan Niu, Xiang Li; Equilibrium seeking of higher-order networks under facet cover constraints. Chaos 1 October 2024; 34 (10): 103145. https://doi.org/10.1063/5.0217669
Download citation file:
Sign in
Don't already have an account? Register
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Pay-Per-View Access
$40.00
80
Views
Citing articles via
Recent achievements in nonlinear dynamics, synchronization, and networks
Dibakar Ghosh, Norbert Marwan, et al.
Sex, ducks, and rock “n” roll: Mathematical model of sexual response
K. B. Blyuss, Y. N. Kyrychko
Nonlinear model reduction from equations and data
Cecilia Pagliantini, Shobhit Jain
Related Content
Local connectivity effects in learning and coordination dynamics in a two-layer network
Chaos (August 2020)
Heterogeneous decision-making dynamics of threshold-switching agents on complex networks
Chaos (December 2023)
A robust sparse identification method for nonlinear dynamic systems affected by non-stationary noise
Chaos (August 2023)
Co-evolution of synchronization and cooperation with multi-agent Q-learning
Chaos (March 2023)