Please use this identifier to cite or link to this item:
https://rda.sliit.lk/handle/123456789/2806
Title: | Disassortative mixing of boundedly-rational players in socio-ecological systems |
Authors: | Ratnayake, P Kasthurirathna, D Piraveenan, M |
Keywords: | Bounded rationality Assortativity Evolutionary games Network science |
Issue Date: | 25-Mar-2022 |
Publisher: | researchgate.net |
Citation: | atnayake, Prasan & Kasthurirathna, Dharshana & Piraveenan, Mahendra. (2022). Disassortative mixing of bounded rationality in socio-ecological systems. |
Abstract: | Bounded 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 players |
URI: | http://rda.sliit.lk/handle/123456789/2806 |
Appears in Collections: | Research Papers - Dept of Computer Science and Software Engineering Research Papers - Open Access Research Research Papers - SLIIT Staff Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2203.12237.pdf | 534.17 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.