TY - GEN
T1 - Impact of multi-valued gossip computational methods on cooperation
AU - Meng, Xiangyu
AU - Zhang, Yanling
AU - Sun, Changyin
N1 - Publisher Copyright:
© 2018 Technical Committee on Control Theory, Chinese Association of Automation.
PY - 2018/10/5
Y1 - 2018/10/5
N2 - Gossip is considered to be an effective mechanism for promoting cooperation, most previous simulation models about gossip usually assume gossip content is expressed in a binary form(good or bad), which ignores the significance of that gossip content is multi-valued. In this paper, we consider the form of gossiping image score to study multi-valued gossip computational methods. Specifically, during the gossip session, two gossipers first gossip to each other their private image scores to everyone, then private image score matrix are updated together in accordance with the average, maximum and minimum of private image scores between two gossipers. Individual-based simulation and analytical results indicated that the three gossip computational methods will lead to the promotion of cooperation compared to the traditional image score model. Among them, when gossip times are greater than a certain threshold, the promotion of cooperation under the minimum method is highest, followed by the maximum method, the average method is worst, and we introduce the index of average image score, intuitively explained the conclusion. Thus, we can conclude that current results further enrich the form of gossip and explores the impact of different multi - valued gossip computational methods for promoting cooperation.
AB - Gossip is considered to be an effective mechanism for promoting cooperation, most previous simulation models about gossip usually assume gossip content is expressed in a binary form(good or bad), which ignores the significance of that gossip content is multi-valued. In this paper, we consider the form of gossiping image score to study multi-valued gossip computational methods. Specifically, during the gossip session, two gossipers first gossip to each other their private image scores to everyone, then private image score matrix are updated together in accordance with the average, maximum and minimum of private image scores between two gossipers. Individual-based simulation and analytical results indicated that the three gossip computational methods will lead to the promotion of cooperation compared to the traditional image score model. Among them, when gossip times are greater than a certain threshold, the promotion of cooperation under the minimum method is highest, followed by the maximum method, the average method is worst, and we introduce the index of average image score, intuitively explained the conclusion. Thus, we can conclude that current results further enrich the form of gossip and explores the impact of different multi - valued gossip computational methods for promoting cooperation.
KW - Cooperation
KW - Evolution
KW - Gossip
KW - Image Score
KW - Indirect Reciprocity
UR - https://www.scopus.com/pages/publications/85056129745
U2 - 10.23919/ChiCC.2018.8484093
DO - 10.23919/ChiCC.2018.8484093
M3 - 会议稿件
AN - SCOPUS:85056129745
T3 - Chinese Control Conference, CCC
SP - 9720
EP - 9724
BT - Proceedings of the 37th Chinese Control Conference, CCC 2018
A2 - Chen, Xin
A2 - Zhao, Qianchuan
PB - IEEE Computer Society
T2 - 37th Chinese Control Conference, CCC 2018
Y2 - 25 July 2018 through 27 July 2018
ER -