A Framework for Mining Collectively-Behaving Bots in MMORPGs

• URL: http://arxiv.org/abs/2501.10461v1
• Date: Wed, 15 Jan 2025 10:11:26 GMT
• Title: A Framework for Mining Collectively-Behaving Bots in MMORPGs
• Authors: Hyunsoo Kim, Jun Hee Kim, Jaeman Son, Jihoon Song, Eunjo Lee,
• Abstract summary: In MMORPGs (Massively Multiplayer Online Role-Playing Games), abnormal players (bots) are commonly observed. We developed BotTRep, a framework that comprises trajectory representation learning followed by clustering. Our model aims to learn representations for in-game trajectory sequences so that players with contextually similar trajectories have closer embeddings.
• Score: 1.2709237540689517
• License:
• Abstract: In MMORPGs (Massively Multiplayer Online Role-Playing Games), abnormal players (bots) using unauthorized automated programs to carry out pre-defined behaviors systematically and repeatedly are commonly observed. Bots usually engage in these activities to gain in-game money, which they eventually trade for real money outside the game. Such abusive activities negatively impact the in-game experiences of legitimate users since bots monopolize specific hunting areas and obtain valuable items. Thus, detecting abnormal players is a significant task for game companies. Motivated by the fact that bots tend to behave collectively with similar in-game trajectories due to the auto-programs, we developed BotTRep, a framework that comprises trajectory representation learning followed by clustering using a completely unlabeled in-game trajectory dataset. Our model aims to learn representations for in-game trajectory sequences so that players with contextually similar trajectories have closer embeddings. Then, by applying DBSCAN to these representations and visualizing the corresponding moving patterns, our framework ultimately assists game masters in identifying and banning bots.

Related papers

• Exploring and Mitigating Adversarial Manipulation of Voting-Based Leaderboards [93.16294577018482]
  Arena, the most popular benchmark of this type, ranks models by asking users to select the better response between two randomly selected models. We show that an attacker can alter the leaderboard (to promote their favorite model or demote competitors) at the cost of roughly a thousand votes. Our attack consists of two steps: first, we show how an attacker can determine which model was used to generate a given reply with more than $95%$ accuracy; and then, the attacker can use this information to consistently vote against a target model.
  arXiv  Detail & Related papers  (2025-01-13T17:12:38Z)
• Learning to Move Like Professional Counter-Strike Players [22.974835711827293]
  We show that it is possible to take a data-driven approach to creating human-like movement controllers for CS:GO. We train a transformer-based movement model that generates human-like team movement for all players in a "Retakes" round of the game. We show that our model performs simple forms of teamwork, makes fewer common movement mistakes, and yields movement distributions, player lifetimes, and kill locations similar to those observed in professional CS:GO match play.
  arXiv  Detail & Related papers  (2024-08-25T20:43:34Z)
• Paying to Do Better: Games with Payments between Learning Agents [4.067193517689939]
  We study the impact of players incorporating monetary transfer policies into their learning agents' algorithms. We propose a simple and general game-theoretic model to capture such scenarios. Results show that in a very broad class of games, self-interested players benefit from letting their learning agents make payments to other learners.
  arXiv  Detail & Related papers  (2024-05-31T14:55:11Z)
• Collusion Detection in Team-Based Multiplayer Games [57.153233321515984]
  We propose a system that detects colluding behaviors in team-based multiplayer games. The proposed method analyzes the players' social relationships paired with their in-game behavioral patterns. We then automate the detection using Isolation Forest, an unsupervised learning technique specialized in highlighting outliers.
  arXiv  Detail & Related papers  (2022-03-10T02:37:39Z)
• Identification of Twitter Bots based on an Explainable ML Framework: the US 2020 Elections Case Study [72.61531092316092]
  This paper focuses on the design of a novel system for identifying Twitter bots based on labeled Twitter data. Supervised machine learning (ML) framework is adopted using an Extreme Gradient Boosting (XGBoost) algorithm. Our study also deploys Shapley Additive Explanations (SHAP) for explaining the ML model predictions.
  arXiv  Detail & Related papers  (2021-12-08T14:12:24Z)
• Adversarial Online Learning with Variable Plays in the Pursuit-Evasion Game: Theoretical Foundations and Application in Connected and Automated Vehicle Cybersecurity [5.9774834479750805]
  We extend the adversarial/non-stochastic multi-play multi-armed bandit (MPMAB) to the case where the number of arms to play is variable. The work is motivated by the fact that the resources allocated to scan different critical locations in an interconnected transportation system change dynamically over time and depending on the environment.
  arXiv  Detail & Related papers  (2021-10-26T23:09:42Z)
• Teach me to play, gamer! Imitative learning in computer games via linguistic description of complex phenomena and decision tree [55.41644538483948]
  We present a new machine learning model by imitation based on the linguistic description of complex phenomena. The method can be a good alternative to design and implement the behaviour of intelligent agents in video game development.
  arXiv  Detail & Related papers  (2021-01-06T21:14:10Z)
• Understand Watchdogs: Discover How Game Bot Get Discovered [8.8519643723088]
  We develop the XAI model using a dataset from the Korean MMORPG, AION. This provides us explanations about the game bots' behavior, and the truthfulness of the explanations has been evaluated.
  arXiv  Detail & Related papers  (2020-11-26T16:34:31Z)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Detection of Novel Social Bots by Ensembles of Specialized Classifiers [60.63582690037839]
  Malicious actors create inauthentic social media accounts controlled in part by algorithms, known as social bots, to disseminate misinformation and agitate online discussion. We show that different types of bots are characterized by different behavioral features. We propose a new supervised learning method that trains classifiers specialized for each class of bots and combines their decisions through the maximum rule.
  arXiv  Detail & Related papers  (2020-06-11T22:59:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.