Research Article
Games on graphs that grow deterministically
@INPROCEEDINGS{10.1109/GAMENETS.2009.5137420, author={Richard Southwell and Chris Cannings}, title={Games on graphs that grow deterministically}, proceedings={1st International Conference on Game Theory for Networks}, publisher={IEEE}, proceedings_a={GAMENETS}, year={2009}, month={6}, keywords={}, doi={10.1109/GAMENETS.2009.5137420} }- Richard Southwell
Chris Cannings
Year: 2009
Games on graphs that grow deterministically
GAMENETS
IEEE
DOI: 10.1109/GAMENETS.2009.5137420
Abstract
We introduce an adaptive graph model where strategy assigned vertices reproduce themselves (having off-spring with the same neighbourhood) and unfit vertices get removed. We study how different games cause different graphs to evolve. Under some games graphs grow and break into self replicating structures. Small initial graphs can lead to the generation of vast dasiaecosystemspsila containing thousands of kinds of structures that change and make copies of one another. Understanding how local interactions induce self replication is important to biology. We examine self replicative processes under various games. We investigate how resilient these processes are to stochasticity and we introduce several modified growth models where analysis of the dynamics is easier.
