Playing video games are meant to be a fun experience but something that has been proven to ruin the experience are cheaters, maybe even more so in events such as tournaments where money is involved. Even if anti-cheating software exists there also exists a research gap in the subject of cheat detection. And regarding cheat detection the question that matters the most is: how do you even detect a player that is using 3rd-party software to gain an unfair advantage in online video games? To find a solution for this problem a systematic literature review was made were data was extracted from articles relevant for the subject and summarised into results. From the results, a few elementary concepts regarding cheat detection are introduced and analysed with comparisons to the problem statement. Finally, five different types of cheat detection are shown that work by analysing objects such as behaviour, game state or memory.

Les jeux massivement multi-joueurs en ligne (jeux MMOGs) visent à rassembler un nombre infini de joueurs dans le même univers virtuel. Pourtant, tous les MMOG existants reposent sur des architectures client / serveur centralisé qui imposent une limite sur le nombre maximum de joueurs (avatars) et sur les ressources qui peuvent coexister dans un univers virtuel donné. Cette thèse vise à proposer des solutions pour améliorer l'évolutivité de MMOG. Cette thèse explore deux services qui sont essentiels à toutes les variantes de MMOG: jumelage et détection de triche. Ces deux services sont les goulots d'étranglement connus, et pourtant les implémentations actuelles restent centralisées. Cette thèse montre également qu'il est possible de concevoir un service d'arbitrage au-dessus d'un système de réputation. Le service résultant reste très efficace sur une grande échelle, à la fois en termes de performance et en termes de prévention de la fraude. Comme l'arbitrage est un problème similaire à la détection de fautes, cette thèse étend l'approche proposée pour surveiller les défaillances. / Massively Multi-player Online Games (MMOGs) aim at gathering an infinite number of players within the same virtual universe. Yet all existing MMOGs rely on centralized client/server architectures which impose a limit on the maximum number of players (avatars) and resources that can coexist in any given virtual universe. This thesis aims at proposing solutions to improve the scalability of MMOGs. To address the wide variety of their concerns, MMOGs rely on independent services such as virtual world hosting, avatar storage, matchmaking, cheat detection, and game design. This thesis explores two services that are crucial to all MMOG variants: matchmaking and cheat detection. Both services are known bottlenecks, and yet current implementations remain centralized. This thesis also shows that it is possible to design a peer to peer refereeing service on top of a reputation system. The resulting service remains highly efficient on a large scale, both in terms of performance and in terms of cheat prevention. Since refereeing is somewhat similar to failure detection, this thesis extends the proposed approach to monitor failures. The resulting failure detection service scales with the number of monitored nodes and tolerates jitter.