基于声誉和未来期望的复杂网络中的利他行为

Dongwei Guo, Yun Zou, Yunna Wu, Miao Liu
{"title":"基于声誉和未来期望的复杂网络中的利他行为","authors":"Dongwei Guo, Yun Zou, Yunna Wu, Miao Liu","doi":"10.1109/IHMSC.2013.156","DOIUrl":null,"url":null,"abstract":"According to game theory, the altruistic behavior on complex network is researched by a mechanism Based on reputation and future expectation we proposed. As the information of players' historical behavior, reputation is an important foundation while players choose opponent. The players not only consider current payoff but also care about future payoff when they employ strategy. Simulations and analyses show players choose cooperation voluntarily for the purpose of payoff-maximizing. The level of convergence average reputation of group does not rely on the level of initial average reputation of group. The group can converge to full cooperation even though the initial average reputation of group is small. In a certain interval, a slight increase of the initial average reputation of group can effectively increase the level of cooperation of group. In addition, we found complex network has a certain ability to resist disturbance by simulating the non-subjective factors exist in the real world. Concentrating on the situation of group state changes from cooperative to defective, dynamic spatial patterns show shortcuts are the main reason of the emergence of new defective clusters under the mechanism.","PeriodicalId":222375,"journal":{"name":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Altruistic Behavior in Complex Network Based on Reputation and Future Expectation\",\"authors\":\"Dongwei Guo, Yun Zou, Yunna Wu, Miao Liu\",\"doi\":\"10.1109/IHMSC.2013.156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"According to game theory, the altruistic behavior on complex network is researched by a mechanism Based on reputation and future expectation we proposed. As the information of players' historical behavior, reputation is an important foundation while players choose opponent. The players not only consider current payoff but also care about future payoff when they employ strategy. Simulations and analyses show players choose cooperation voluntarily for the purpose of payoff-maximizing. The level of convergence average reputation of group does not rely on the level of initial average reputation of group. The group can converge to full cooperation even though the initial average reputation of group is small. In a certain interval, a slight increase of the initial average reputation of group can effectively increase the level of cooperation of group. In addition, we found complex network has a certain ability to resist disturbance by simulating the non-subjective factors exist in the real world. Concentrating on the situation of group state changes from cooperative to defective, dynamic spatial patterns show shortcuts are the main reason of the emergence of new defective clusters under the mechanism.\",\"PeriodicalId\":222375,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IHMSC.2013.156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2013.156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于博弈论,提出了一种基于声誉和未来期望的复杂网络利他行为机制。声誉作为玩家历史行为的信息,是玩家选择对手的重要依据。参与者在使用策略时不仅考虑当前收益,还关心未来收益。仿真和分析表明,参与者出于收益最大化的目的,自愿选择合作。群体的收敛平均声誉水平不依赖于群体的初始平均声誉水平。即使群体的初始平均声誉很小,群体也可以收敛到完全合作。在一定的时间间隔内,群体初始平均声誉的轻微提高可以有效地提高群体的合作水平。此外,通过模拟现实世界中存在的非主观因素,我们发现复杂网络具有一定的抗干扰能力。从群体状态由合作向缺陷转变的情况来看,动态空间格局显示出的捷径是机制下新的缺陷集群产生的主要原因。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Altruistic Behavior in Complex Network Based on Reputation and Future Expectation
According to game theory, the altruistic behavior on complex network is researched by a mechanism Based on reputation and future expectation we proposed. As the information of players' historical behavior, reputation is an important foundation while players choose opponent. The players not only consider current payoff but also care about future payoff when they employ strategy. Simulations and analyses show players choose cooperation voluntarily for the purpose of payoff-maximizing. The level of convergence average reputation of group does not rely on the level of initial average reputation of group. The group can converge to full cooperation even though the initial average reputation of group is small. In a certain interval, a slight increase of the initial average reputation of group can effectively increase the level of cooperation of group. In addition, we found complex network has a certain ability to resist disturbance by simulating the non-subjective factors exist in the real world. Concentrating on the situation of group state changes from cooperative to defective, dynamic spatial patterns show shortcuts are the main reason of the emergence of new defective clusters under the mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信