Combining Sequential and Aggregated Data for Churn Prediction in Casual Freemium Games

• URL: http://arxiv.org/abs/2209.03184v1
• Date: Tue, 6 Sep 2022 14:49:18 GMT
• Title: Combining Sequential and Aggregated Data for Churn Prediction in Casual Freemium Games
• Authors: Jeppe Theiss Kristensen and Paolo Burelli
• Abstract summary: In freemium games, the revenue from a player comes from the in-app purchases made and the advertisement to which that player is exposed. Within this scenario, it is extremely important to be able to detect promptly when a player is about to quit playing. We investigate how to improve the current state-of-the-art in churn prediction by combining sequential and aggregate data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In freemium games, the revenue from a player comes from the in-app purchases made and the advertisement to which that player is exposed. The longer a player is playing the game, the higher will be the chances that he or she will generate a revenue within the game. Within this scenario, it is extremely important to be able to detect promptly when a player is about to quit playing (churn) in order to react and attempt to retain the player within the game, thus prolonging his or her game lifetime. In this article we investigate how to improve the current state-of-the-art in churn prediction by combining sequential and aggregate data using different neural network architectures. The results of the comparative analysis show that the combination of the two data types grants an improvement in the prediction accuracy over predictors based on either purely sequential or purely aggregated data.

Related papers

• Collaborative-Enhanced Prediction of Spending on Newly Downloaded Mobile Games under Consumption Uncertainty [49.431361908465036]
  We propose a robust model training and evaluation framework to mitigate label variance and extremes. Within this framework, we introduce a collaborative-enhanced model designed to predict user game spending without relying on user IDs. Our approach demonstrates notable improvements over production models, achieving a remarkable textbf17.11% enhancement on offline data.
  arXiv  Detail & Related papers  (2024-04-12T07:47:02Z)
• Predicting Outcomes in Video Games with Long Short Term Memory Networks [0.39723189359605243]
  Our work attempts to enhance audience engagement within video game tournaments by introducing a real-time method of predicting wins. As a proof of concept, we evaluate our model's performance within a classic, two-player arcade game, Super Street Fighter II Turbo.
  arXiv  Detail & Related papers  (2024-02-24T22:36:23Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• Graph Neural Networks to Predict Sports Outcomes [0.0]
  We introduce a sport-agnostic graph-based representation of game states. We then use our proposed graph representation as input to graph neural networks to predict sports outcomes.
  arXiv  Detail & Related papers  (2022-07-28T14:45:02Z)
• 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)
• An Empirical Study on the Generalization Power of Neural Representations Learned via Visual Guessing Games [79.23847247132345]
  This work investigates how well an artificial agent can benefit from playing guessing games when later asked to perform on novel NLP downstream tasks such as Visual Question Answering (VQA) We propose two ways to exploit playing guessing games: 1) a supervised learning scenario in which the agent learns to mimic successful guessing games and 2) a novel way for an agent to play by itself, called Self-play via Iterated Experience Learning (SPIEL)
  arXiv  Detail & Related papers  (2021-01-31T10:30:48Z)
• Predicting Events in MOBA Games: Dataset, Attribution, and Evaluation [37.16502752193698]
  In this work, we collect and release a large-scale dataset containing rich in-game features for the popular MOBA game Honor of Kings. We then propose to predict four types of important events in an interpretable way by attributing the predictions to the input features using two gradient-based attribution methods.
  arXiv  Detail & Related papers  (2020-12-17T07:28:35Z)
• Detecting Video Game Player Burnout with the Use of Sensor Data and Machine Learning [15.838305794790022]
  We propose the methods based on the sensor data analysis for predicting whether a player will win the future encounter. The sensor data were collected from 10 participants in 22 matches in League of Legends video game. We have trained machine learning models including Transformer and Gated Recurrent Unit to predict whether the player wins the encounter taking place after some fixed time in the future.
  arXiv  Detail & Related papers  (2020-11-29T21:16:09Z)
• Interpretable Real-Time Win Prediction for Honor of Kings, a Popular Mobile MOBA Esport [51.20042288437171]
  We propose a Two-Stage Spatial-Temporal Network (TSSTN) that can provide accurate real-time win predictions. Experiment results and applications in real-world live streaming scenarios showed that the proposed TSSTN model is effective both in prediction accuracy and interpretability.
  arXiv  Detail & Related papers  (2020-08-14T12:00:58Z)
• From Poincar\'e Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization [49.368421783733815]
  We show how adapting the reward can give strong convergence guarantees in monotone games. We also show how this reward adaptation technique can be leveraged to build algorithms that converge exactly to the Nash equilibrium.
  arXiv  Detail & Related papers  (2020-02-19T21:36:58Z)

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.