Fraud and Bot Detection in Gaming Marketplaces
DOI:
https://doi.org/10.63282/3050-9262.IJAIDSML-V7I1P121Keywords:
Game Marketplaces, Fraud Detection, Bot Detection, Gift Coupon Abuse, Discount Code Mis-Use, Account-Based Fraud, API Monitoring, Keystroke Anomaly, Operational SecurityAbstract
Cloud-scale game marketplaces face increas-ing threats from automated activity and coordinated abuse, including repeated redemption of gift coupons and single- use discount codes, as well as the creation of free or secondary accounts to inherit starter currencies or in- game assets. This paper surveys practical detection ap- proaches suitable for real-time production environments, emphasizing observable system signals rather than model- heavy or AI-driven methods. We describe techniques for monitoring API call sequences and rates, simple behav- ioral signals such as keystroke latency, and graph-based linkage analysis to detect clusters of accounts exploit- ing shared vouchers or resource transfers. Operational tradeoffs including latency, privacy, and computational cost are discussed, along with strategies for mitigating abuse through tiered interventions. This work provides a framework for deploying effective fraud detection while preserving legitimate user experience in rapidly evolving game marketplaces.
References
[1] E. Lee, J. Woo, H. Kim, A. Mohaisen, and H. K. Kim, “You are a game bot!: Uncovering game bots in mmorpgs via self-similarity in the wild,” in NDSS (Network and Distributed System Security) Symposium, 2016. [Online]. Available: https://www.ndss-symposium. org/wp-content/uploads/2017/09/you-are-game-bot-uncovering-game-bots-mmorp.pdf
[2] M. Fahey, “Keystroke lag alerts amazon security staff that recent us-based it hire was actually in north korea,” PC Gamer (online), 2025. [Online]. Available: https://www.pcgamer.com keystroke-lag-alerts-amazon-security-staff-that-recent-us- gs-via-s
[3] A. R. Kang, S. H. Jeong, A. Mohaisen, and H. K. Kim, “Multimodal game bot detection using user behavioral characteristics,” SpringerPlus, vol. 5, p. 523, 2016. [Online]. Available: https://pmc.ncbi.nlm.nih.gov/articles/ PMC4844581/
[4] Y. Yang, Q. Wu, B. He, H. Peng, R. Yang, Z. Hao, and Y. Liao, “Sebot: Structural entropy guided multi-view contrastive learning for social bot detection,” in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2024.[Online]. Available: https://arxiv.org/abs/2405. 11225
[5] P. Indyk and R. Motwani, “Approximate near- est neighbors: Towards removing the curse of dimensionality,” in Proceedings of the 30th An- nual ACM Symposium on Theory of Computing (STOC), 1998, pp. 604–613.
[6] G. Cormode and S. Muthukrishnan, “An improved data stream summary: the count–min sketch and its applications,” Journal of Algo- rithms, vol. 55, no. 1, pp. 58–75, 2005.
[7] P. Flajolet, E Fusy, O. Gandouet, and F. Meunier, “Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm,” in Proceedings of the 2007 International Conference on Analytic Algorithms and Combinatorics (AofA), 2007, pp. 127–146.[Online]. Available: https://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf










