首页> 外文会议>Symposium on Adaptive Agents and Multi-Agent Systems >Robust Online Reputation Mechanism by Stochastic Approximation
【24h】

Robust Online Reputation Mechanism by Stochastic Approximation

机译:通过随机近似强大的在线声誉机制

获取原文

摘要

Recently, online reputation mechanisms have attracted much attention in many areas. They have been widely adopted and worked well, although their reliability is still a major concern. Because of online properties such as openness and anonymity, it is necessary to consider rating errors, noise and unfair lies. Furthermore, these disturbances (attacks) have a significant effect on multi-agent systems containing malicious agents who tell lies or engage in strategic manipulations. Current online reputation mechanisms are not sufficiently robust against such disturbances. In an attempt to solve this problem, we propose a stochastic approximation-based online reputation mechanism. Our mechanism assigns one global trustworthiness value to each agent and updates estimates of these values dynamically from mutual ratings of agents. Experimental results show that our mechanism is able to identify good and bad agents effectively under condition of the above disturbances and also trace the changes in agents' true trustworthiness values adaptively.
机译:最近,在线声誉机制在许多领域引起了很多关注。它们已被广泛采用和运作良好,尽管他们的可靠性仍然是一个主要问题。由于诸如开放性和匿名的在线属性,有必要考虑评级错误,噪音和不公平的谎言。此外,这些干扰(攻击)对含有含有恶意代理商的多种子体系统具有显着影响,他们会告诉谎言或从事战略操纵。目前的在线声誉机制对这种干扰不够强大。为了解决这个问题,我们提出了一种基于随机近似的在线声誉机制。我们的机制为每个代理分配一个全局可靠性值,并从相互评级的代理商动态更新这些值的估计。实验结果表明,我们的机制能够在上述干扰的条件下有效地识别良好和不良的药剂,并且还适当地追踪了代理人的真正可靠价值的变化。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号