Research Papers - Dept of Software Engineering
Permanent URI for this collectionhttps://rda.sliit.lk/handle/123456789/1022
Browse
2 results
Search Results
Publication Embargo Quantifying encircling behaviour in complex networks(IEEE, 2013-04-16) Piraveenan, M; Uddin, S; Chung, K. S. K; Kasthurirathna, DIn this paper, we explore the effect of encircling behaviour on the topology of complex networks. We introduce the concept of topological encircling, which we define as an attacker making links to neighbours of a victim with the ultimate aim of undermining that victim. We introduce metrics to quantify topological encircling in complex networks, both at the network level and node pair (link) level. Using synthesized networks, we demonstrate that our measures are able to distinguish intentional topological encircling from preferential mixing. We discuss the potential utility of our measures and future research directions.Publication Open Access Optimisation of strategy placements for public good in complex networks(acm.org, 2014-08-04) Kasthurirathna, D; Nguyen, H; Piraveenan, M; Uddin, S; Senanayake, UGame theory has long been used to model cognitive decision making in societies. While traditional game theoretic modelling has focussed on well-mixed populations, recent research has suggested that the topological structure of social networks play an important part in the dynamic behaviour of social systems. Any agent or person playing a game employs a strategy (pure or mixed) to optimise pay-off. Previous studies have analysed how selfish agents can optimise their payoffs by choosing particular strategies within a social network model. In this paper we ask the question that, if agents were to work towards the common goal of increasing the public good (that is, the total network utility), what strategies they should adapt within the context of a heterogeneous network. We consider a number of classical and recently demonstrated game theoretic strategies, including cooperation, defection, general cooperation, Pavlov, and zero-determinant strategies, and compare them pairwise. We use the Iterative Prisoners Dilemma game simulated on scale-free networks, and use a genetic-algorithmic approach to investigate what optimal placement patterns evolve in terms of strategy. In particular, we ask the question that, given a pair of strategies are present in a network, which strategy should be adopted by the hubs (highly connected people), for the overall betterment of society (high network utility). We find that cooperation as opposed to defection, Pavlov as opposed to general cooperator, general cooperator as opposed to zero-determinant, and pavlov as opposed to zero-determinant, strategies will be adopted by the hubs, for the overall increased utility of the network. The results are interesting, since given a scenario where certain individuals are only capable of implementing certain strategies, the results give a blueprint on where they should be placed in a complex network for the overall benefit of the society.
