Improving the Effectiveness of Eigentrust in Computing the Reputation of Social Agents in Presence of Collusion.

International journal of neural systems Pub Date : 2024-02-01 Epub Date: 2023-10-07 DOI:10.1142/S0129065723500636
Mariantonia Cotronei, Sofia Giuffrè, Attilio Marcianò, Domenico Rosaci, Giuseppe M L Sarnè
{"title":"Improving the Effectiveness of Eigentrust in Computing the Reputation of Social Agents in Presence of Collusion.","authors":"Mariantonia Cotronei, Sofia Giuffrè, Attilio Marcianò, Domenico Rosaci, Giuseppe M L Sarnè","doi":"10.1142/S0129065723500636","DOIUrl":null,"url":null,"abstract":"<p><p>The introduction of trust-based approaches in social scenarios modeled as multi-agent systems (MAS) has been recognized as a valid solution to improve the effectiveness of these communities. In fact, they make interactions taking place in social scenarios much fruitful as possible, limiting or even avoiding malicious or fraudulent behaviors, including collusion. This is also the case of multi-layered neural networks (NN), which can face limited, incomplete, misleading, controversial or noisy datasets, produced by untrustworthy agents. Many strategies to deal with malicious agents in social networks have been proposed in the literature. One of the most effective is represented by Eigentrust, often adopted as a benchmark. It can be seen as a variation of PageRank, an algorithm for determining result rankings used by search engines like Google. Moreover, Eigentrust can also be viewed as a linear neural network whose architecture is represented by the graph of Web pages. A major drawback of Eigentrust is that it uses some additional information about agents that can be <i>a priori</i> considered particularly trustworthy, rewarding them in terms of reputation, while the non pre-trusted agents are penalized. In this paper, we propose a different strategy to detect malicious agents which does not modify the real reputation values of the honest ones. We introduce a measure of effectiveness when computing reputation in presence of malicious agents. Moreover, we define a metric of error useful to quantitatively determine how much an algorithm for the identification of malicious agents modifies the reputation scores of the honest ones. We have performed an experimental campaign of mathematical simulations on a dynamic multi-agent environment. The obtained results show that our method is more effective than Eigentrust in determining reputation values, presenting an error which is about a thousand times lower than the error produced by Eigentrust on medium-sized social networks.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2350063"},"PeriodicalIF":0.0000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of neural systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129065723500636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/10/7 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The introduction of trust-based approaches in social scenarios modeled as multi-agent systems (MAS) has been recognized as a valid solution to improve the effectiveness of these communities. In fact, they make interactions taking place in social scenarios much fruitful as possible, limiting or even avoiding malicious or fraudulent behaviors, including collusion. This is also the case of multi-layered neural networks (NN), which can face limited, incomplete, misleading, controversial or noisy datasets, produced by untrustworthy agents. Many strategies to deal with malicious agents in social networks have been proposed in the literature. One of the most effective is represented by Eigentrust, often adopted as a benchmark. It can be seen as a variation of PageRank, an algorithm for determining result rankings used by search engines like Google. Moreover, Eigentrust can also be viewed as a linear neural network whose architecture is represented by the graph of Web pages. A major drawback of Eigentrust is that it uses some additional information about agents that can be a priori considered particularly trustworthy, rewarding them in terms of reputation, while the non pre-trusted agents are penalized. In this paper, we propose a different strategy to detect malicious agents which does not modify the real reputation values of the honest ones. We introduce a measure of effectiveness when computing reputation in presence of malicious agents. Moreover, we define a metric of error useful to quantitatively determine how much an algorithm for the identification of malicious agents modifies the reputation scores of the honest ones. We have performed an experimental campaign of mathematical simulations on a dynamic multi-agent environment. The obtained results show that our method is more effective than Eigentrust in determining reputation values, presenting an error which is about a thousand times lower than the error produced by Eigentrust on medium-sized social networks.

在存在共谋的情况下计算社会代理信誉时提高特征信任的有效性。
在建模为多智能体系统(MAS)的社会场景中引入基于信任的方法已被认为是提高这些社区有效性的有效解决方案。事实上,它们使社交场景中发生的互动尽可能富有成效,限制甚至避免恶意或欺诈行为,包括共谋。多层神经网络(NN)也是如此,它可能面临由不可信的代理产生的有限、不完整、误导、有争议或有噪声的数据集。文献中已经提出了许多处理社交网络中恶意代理的策略。其中最有效的是Eigentrust,它经常被用作基准。它可以被视为PageRank的变体,PageRank是谷歌等搜索引擎使用的一种用于确定结果排名的算法。此外,特征信任也可以被视为一种线性神经网络,其结构由网页图表示。Eigentrust的一个主要缺点是,它使用了一些关于代理的额外信息,这些信息可以被先验地认为是特别值得信赖的,根据声誉来奖励他们,而不预先信任的代理则会受到惩罚。在本文中,我们提出了一种不同的策略来检测恶意代理,该策略不会修改诚实代理的真实信誉值。我们介绍了在存在恶意代理的情况下计算信誉时的有效性度量。此外,我们定义了一个误差度量,用于定量确定识别恶意代理的算法在多大程度上修改了诚实代理的信誉分数。我们在动态多智能体环境中进行了一次数学模拟实验活动。结果表明,在确定信誉值方面,我们的方法比Eigentrust更有效,在中等规模的社交网络上,其误差比Eigentrust产生的误差低一千倍左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信