论文标题
基于团队的多人游戏中的串谋检测
Collusion Detection in Team-Based Multiplayer Games
论文作者
论文摘要
在竞争性的多人游戏的背景下,当两个或多个团队决定实现共同目标时,勾结发生,目的是从这种合作中获得不公平的优势。然而,由于玩家人数的庞大规模,从玩家人数中识别伙伴的任务是不可行的。在本文中,我们提出了一个系统,该系统检测基于团队的多人游戏中的勾结行为,并突出显示最有可能表现出串通行为的玩家。然后,游戏设计师继续分析较小的玩家子集,并决定采取什么行动。因此,在自动检测时,要对误报非常谨慎是必要的,并且有必要。所提出的方法分析了玩家的社会关系与他们的游戏中的行为模式配对,并使用图理论的工具渗透了一个功能集,该功能集使我们能够检测和测量每对相对团队中每对球员所表现出的勾结程度。然后,我们使用隔离林自动化检测,这是一种专门针对异常值的无监督学习技术,并在两个真实数据集上显示我们方法的性能和效率,每个数据集都有超过170,000个独特的玩家和超过100,000个不同的匹配。
In the context of competitive multiplayer games, collusion happens when two or more teams decide to collaborate towards a common goal, with the intention of gaining an unfair advantage from this cooperation. The task of identifying colluders from the player population is however infeasible to game designers due to the sheer size of the player population. In this paper, we propose a system that detects colluding behaviors in team-based multiplayer games and highlights the players that most likely exhibit colluding behaviors. The game designers then proceed to analyze a smaller subset of players and decide what action to take. For this reason, it is important and necessary to be extremely careful with false positives when automating the detection. The proposed method analyzes the players' social relationships paired with their in-game behavioral patterns and, using tools from graph theory, infers a feature set that allows us to detect and measure the degree of collusion exhibited by each pair of players from opposing teams. We then automate the detection using Isolation Forest, an unsupervised learning technique specialized in highlighting outliers, and show the performance and efficiency of our approach on two real datasets, each with over 170,000 unique players and over 100,000 different matches.