Characterizing Game Dynamics in Two-Player Strategy Games Using Network Motifs
Authors:
- Ayman GhoneimAGAyman Ghoneim
- Hussein AbbassHAHussein Abbass
- Michael BarlowMBMichael Barlow
- 25 April 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 38 (3) , 682-690
Abstract
Many complex systems, whether biological, sociological, or physical ones, can be represented using networks. In these networks, a node represents an entity, and an arc represents a relationship/constraint between two entities. In discrete dynamics, one can construct a series of networks with each network representing a time snapshot of interaction among the different components in the system. Understanding these networks is a key to understand the dynamics of real and artificial systems. Network motifs are small graphs-usually three to four nodes-representing local structures. They have been widely used in studying complex systems and in characterizing features on the system level by analyzing locally how the substructures are formed. Frequencies of different network motifs have been shown in the literature to vary from one network to another, and conclusions hypothesized that these variations are due to the evolution/dynamics of the system. In this paper, we show for the first time that in strategy games, each game (i.e., type of dynamism) has its own signature of motifs and that this signature is maintained during the evolution of the game. We reveal that deterministic strategy games have unique footprints (motifs' count) that can be used to recognize and classify the game's type and that these footprints are consistent along the evolutionary path of the game. The findings of this paper have significance for a wide range of fields in cybernetics.Keywords
This publication has 18 references indexed in Scilit:
- Rounds Effect in Evolutionary Games2007
- Cooperation in the noisy case: Prisoner’s dilemma game on two types of regular random graphsPhysical Review E, 2006
- Understanding representational sensitivity in the iterated prisoner's dilemma with fingerprintsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2006
- Lasting impressions: Motifs in protein–protein maps may provide footprints of evolutionary eventsProceedings of the National Academy of Sciences, 2005
- Comment on "Network Motifs: Simple Building Blocks of Complex Networks" and "Superfamilies of Evolved and Designed Networks"Science, 2004
- The Coherent Feedforward Loop Serves as a Sign-sensitive Delay Element in Transcription NetworksJournal of Molecular Biology, 2003
- A dynamic model of social network formationProceedings of the National Academy of Sciences, 2000
- Evolutionary stability in the n-person iterated prisoner's dilemmaBioSystems, 1996
- On evolving robust strategies for iterated prisoner's dilemma1995
- Evolving Behaviors in the Iterated Prisoner's DilemmaEvolutionary Computation, 1993