Title:	IDENTIFYING A GAME-THEORETIC TRANSITION THRESHOLD ON HYPERBOLIC NETWORKS
Author(s):	Christine Marshall, James Cruickshank and Colm O’Riordan
ISBN:	978-989-8533-80-7
Editors:	Ajith P. Abraham, Jörg Roth and Guo Chao Peng
Year:	2018
Edition:	Single
Keywords:	Game Theory, Hyperbolic Random Geometric Graphs, Transition Threshold, Diffusion Processes, Complex Networks
Type:	Full Paper
First Page:	97
Last Page:	104
Language:	English
Cover:
Full Contents:	click to dowload
Paper Abstract:	In this work we explore agent based simulations of The Prisoner's Dilemma on a set of hyperbolic random geometric graphs, ranging from unconnected to fully connected graphs. Hyperbolic random geometric graphs share many features with real world complex networks, having power law degree distribution, short path lengths and high clustering. We find that as we increase the number of edges in the graphs, there is a clear transition, above which defection spreads to all nodes in the graph, below which the graphs are resistant to defection. We use a game-theoretic approach, based on the Prisoner’s Dilemma, to model diffusion in the network, and our analysis of global graph properties at the threshold offers some insight into structural properties which might facilitate or inhibit the spread of defection in the network.
	Go Back