隐藏联盟阻挡偷袭(扩展版)
Blocking Underhand Attacks by Hidden Coalitions (Extended Version)
摘要:
类似于现实世界中人类之间发生的事情,在分布在互联网上的开放式多智能体系统中,例如在线社交网络或维基技术,智能体通常通过同意作为一个整体行动来形成联盟,以实现某些共同目标。然而,代理联盟并不总是系统的理想特征,因为恶意或腐败代理可能会合作以破坏或攻击系统。在本文中,我们考虑隐藏联盟的问题,系统不知道隐藏联盟的存在及其要实现的目的,并且隐藏联盟进行所谓的秘密攻击。我们通过引入一种确定性方法来阻止潜在危险代理的行为,即可能属于这种联盟,从而给出了隐藏联盟的第一种方法。我们还给出了这种方法的非确定性版本,该方法阻止了潜在危险代理的最小集合。我们计算了这两种分块方法的计算代价,并证明了它们的可靠性和完备性。
英文摘要:
Similar to what happens between humans in the real world, in open multi-agent systems distributed over the Internet, such as online social networks or wiki technologies, agents often form coalitions by agreeing to act as a whole in order to achieve certain common goals. However, agent coalitions are not always a desirable feature of a system, as malicious or corrupt agents may collaborate in order to subvert or attack the system. In this paper, we consider the problem of hidden coalitions, whose existence and the purposes they aim to achieve are not known to the system, and which carry out so-called underhand attacks. We give a first approach to hidden coalitions by introducing a deterministic method that blocks the actions of potentially dangerous agents, i.e. possibly belonging to such coalitions. We also give a non-deterministic version of this method that blocks the smallest set of potentially dangerous agents. We calculate the computational cost of our two blocking methods, and prove their soundness and completeness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。