Faculty of Computing
Permanent URI for this communityhttps://rda.sliit.lk/handle/123456789/4202
Browse
3 results
Filters
Advanced Search
Filter by
Settings
Search Results
Item Open Access Exploring emergent topological properties in socio-economic networks through learning heterogeneity(2025-12-10) Karavita, C; Lyu, Z; Kasthurirathna, D; Piraveenan, MUnderstanding how individual learning behavior and structural dynamics interact is essential to modeling emergent phenomena in socio-economic networks. While bounded rationality and network adaptation have been widely studied, the role of heterogeneous learning rates–both at the agent and network levels–remains underexplored. This paper introduces a dual-learning framework that integrates individualized learning rates for agents and a rewiring rate for the network, reflecting real-world cognitive diversity and structural adaptability. Using a simulation model based on the Prisoner’s Dilemma and Quantal Response Equilibrium, we analyze how variations in these learning rates affect the emergence of large-scale network structures. Results show that lower and more homogeneously distributed learning rates promote scale-free networks, while higher or more heterogeneously distributed learning rates lead to the emergence of core-periphery topologies. Key topological metrics–including scale-free exponents, Estrada heterogeneity, and assortativity–reveal that both the speed and variability of learning critically shape system rationality and network architecture. This work provides a unified framework for examining how individual learnability and structural adaptability drive the formation of socio-economic networks with diverse topologies, offering new insights into adaptive behavior, systemic organization, and resilience.Publication Open Access Disassortative mixing of boundedly-rational players in socio-ecological systems(researchgate.net, 2022-03-25) Ratnayake, P; Kasthurirathna, D; Piraveenan, MBounded rationality refers to the non-optimal rationality of players in non-cooperative games. In a networked game, the bounded rationality of players may be heterogeneous and spatially distributed. It has been shown that the ‘system rationality’, which indicates the overall rationality of a network of players, may play a key role in the emergence of scale-free or core-periphery topologies in real-world networks. On the other hand, scalar-assortativity is a metric used to quantify the assortative mixing of nodes with respect to a given scalar attribute. In this work, we observe the effect of node rationality-based scalar-assortativity, on the system rationality of a network. Based on simulation results, we show that irrespective of the placement of nodes with higher rationality, it is the disassortative mixing of node rationality that helps to maximize system rationality in a population. The findings may have useful interpretations and applications in socio-economic systems in maximizing the utility of interactions in a population of strategic playersPublication Open Access Optimising influence in social networks using bounded rationality models(Springer Vienna, 2016-12) Kasthurirathna, D; Harre, M; Piraveenan, MInfluence models enable the modelling of the spread of ideas, opinions and behaviours in social networks. Bounded rationality in social networks suggests that players make non-optimum decisions due to the limitations of access to information. Based on the premise that adopting a state or an idea can be regarded as being ‘rational’, we propose an influence model based on the heterogeneous bounded rationality of players in a social network. We employ the quantal response equilibrium model to incorporate the bounded rationality in the context of social influence. We hypothesise that bounded rationality of following a seed or adopting the strategy of a seed is negatively proportional to the distance from that node, and it follows that closeness centrality is the appropriate measure to place influencers in a social network. We argue that this model can be used in scenarios where there are multiple types of influencers and varying pay-offs of adopting a state. We compare different seed placement mechanisms to compare and contrast the optimum method to minimise the existing social influence in a network when there are multiple and conflicting seeds. We ascertain that placing of opposing seeds according to a measure derived from a combination of the betweenness centrality values from the seeds, and the closeness centrality of the network provide the maximum negative influence. Further, we extend this model to a strategic decision-making scenario where each seed operates a strategy in a strategic game.