Games on graphs that grow deterministically

rumblecleverAI and Robotics

Dec 1, 2013 (3 years and 6 months ago)

105 views

UK Higher Education Institutions (UK
HEI):

The University of Sheffield



Subscribe

(Full
Service)


Register

(Limited Service,
Free
)


Login





Search:

The ACM Digital Library

The
Guide











Feedback


Take a look at the new version of this page: [
beta version

]. Tell us what
you think.


Games on graphs that grow deterministically

Source


Proceedings of the First ICST international conference
on Game Theory for Networks
table of contents

Istanbul, Turkey

Pages: 347
-
356



Year of Publication:

2009

ISBN:978
-
1
-
4244
-
4176
-
1

Authors


Richard
Southwell



School of Mathematics and St
atistics, University of
Sheffield, United Kingdom


Chris Cannings



School of Mathematics and Stati
stics, University of
Sheffield, The United Kingdom



Publisher

IEEE Press


Piscataway, NJ, USA


Bibliometrics

Downloads (6 Weeks): n/a,


Downloads (12 Months): n/a,


Citation Count: 0










Additional Information:

abstract


references








Tools and
Actions:

Review this Article



Save this Article to a Binder



Display Formats:

BibTeX


EndNote

ACM
Ref

















ABSTRACT


We introduce an adaptive graph model where strategy assigned vertices reproduce
themselves (having offspring 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 'ecosystems' 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.


RE
FERENCES


Note: OCR errors may be found in this Reference List extracted from the full text article.
ACM has opted to expose the complete List rather than only correct and linked
references.



1

G. Szabo and J. M. Fath, "Evolutionary games on graphs",
Phy
sics Reports 447
,
pp. 97
-
216, 2007.



2

M. Nowak and R. M. May, "Evolutionary games and spatial chaos",
Nature 359
, pp.
826
-
829, 1992.



3

F. C. Santos, J. M. Pacheco and Lenaerts T., "Evolutionary Dynamics of Social
Dilemmas in Structured Heterogeneous Populations",
Proc. Natl. Acad. Sci. USA,
103
, pp. 3490
-
3494, 2006.



4

R. Southwell and C. Cannings, "Some models of reproducing graphs.
I pure
reproduction.",
In preparation
, 2009.



5

A. Lindenmayer, "Mathematical model of cellular interactions in the development.
I. Filaments with one
-
sided inputs. II. Simple and branching filaments with two
-
sided inputs",
Journal of Theoretical Biolo
gy 18
, pp. 280
-
299, pp. 300
-
315, 1968.



6

H. Tomita, H. Kurokawa and S. Murata, "Graph automata: Natural expression of
self
-
reproductions",
Physica D, 171
, pp. 197
-
210, 2002.



7

H. Tomita, H. Kurokawa and S. Murata, "Automatic Generation of Self
-
Replicating
Patterns in Graph Automata",
International Journal of Bifurcation and Chaos 16,
no. 4
, pp. 1011
-
1018, 2006.



8

P. Erdos and A. Renyi, "The evolution of random graphs",
Publ
. Math. Inst.
Hungar. Acad. Sci
,
5
, pp. 17
-
61, 1960.



9

J. Leskovec, D. Chakrabarti, J. M. Klienberg and C. Faloutos, "Realistic,
mathematically tractable graph generation and evolution using kronecker
multiplication",
PPKD
,
5
, pp. 133
-
145, 2005.


Th
e ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.

Terms of Usage


Privacy Policy


Code of Ethics


Contact Us



Useful downloads:
Adobe Acrobat



QuickTime



Windows Media Player



Real
Player