Predicting Customer Lifetime Value in Free-to-Play Games

• URL: http://arxiv.org/abs/2209.12619v1
• Date: Tue, 6 Sep 2022 15:02:14 GMT
• Title: Predicting Customer Lifetime Value in Free-to-Play Games
• Authors: Paolo Burelli
• Abstract summary: We will present an overview of customer lifetime value modeling across different fields. We will introduce the challenges specific to free-to-play games across different platforms and genres.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As game companies increasingly embrace a service-oriented business model, the need for predictive models of players becomes more pressing. Multiple activities, such as user acquisition, live game operations or game design need to be supported with information about the choices made by the players and the choices they could make in the future. This is especially true in the context of free-to-play games, where the absence of a pay wall and the erratic nature of the players' playing and spending behavior make predictions about the revenue and allocation of budget and resources extremely challenging. In this chapter we will present an overview of customer lifetime value modeling across different fields, we will introduce the challenges specific to free-to-play games across different platforms and genres and we will discuss the state-of-the-art solutions with practical examples and references to existing implementations.

Related papers

• Efficient Feature Interactions with Transformers: Improving User Spending Propensity Predictions in Gaming [0.5755004576310334]
  We discuss the problem of predicting the user's propensity to spend in a gaming round, so it can be utilized for various downstream applications. e.g. upselling users by incentivizing them marginally as per their spending propensity, or personalizing the product listing based on the user's propensity to spend. We show that our proposed architecture outperforms the existing models on the task of predicting the user's propensity to spend in a gaming round.
  arXiv  Detail & Related papers  (2024-09-25T16:40:51Z)
• 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)
• A Conceptual Design of In-Game Real and Virtual Currency Tracker [0.0]
  In-game virtual currencies can invoke inadequate gaming behaviors and additions among players. The market lacks gaming and customer protection regulations to avoid the financial, behavioral, and psychological exploitation of users. This paper presents a conceptual design of an in-game purchasing module that allows the user to observe their real time spendings in relation to virtual currency buying.
  arXiv  Detail & Related papers  (2024-04-05T08:34:22Z)
• ShuttleSHAP: A Turn-Based Feature Attribution Approach for Analyzing Forecasting Models in Badminton [52.21869064818728]
  Deep learning approaches for player tactic forecasting in badminton show promising performance partially attributed to effective reasoning about rally-player interactions. We propose a turn-based feature attribution approach, ShuttleSHAP, for analyzing forecasting models in badminton based on variants of Shapley values.
  arXiv  Detail & Related papers  (2023-12-18T05:37:51Z)
• All by Myself: Learning Individualized Competitive Behaviour with a Contrastive Reinforcement Learning optimization [57.615269148301515]
  In a competitive game scenario, a set of agents have to learn decisions that maximize their goals and minimize their adversaries' goals at the same time. We propose a novel model composed of three neural layers that learn a representation of a competitive game, learn how to map the strategy of specific opponents, and how to disrupt them. Our experiments demonstrate that our model achieves better performance when playing against offline, online, and competitive-specific models, in particular when playing against the same opponent multiple times.
  arXiv  Detail & Related papers  (2023-10-02T08:11:07Z)
• Promptable Game Models: Text-Guided Game Simulation via Masked Diffusion Models [68.85478477006178]
  We present a Promptable Game Model (PGM) for neural video game simulators. It allows a user to play the game by prompting it with high- and low-level action sequences. Most captivatingly, our PGM unlocks the director's mode, where the game is played by specifying goals for the agents in the form of a prompt. Our method significantly outperforms existing neural video game simulators in terms of rendering quality and unlocks applications beyond the capabilities of the current state of the art.
  arXiv  Detail & Related papers  (2023-03-23T17:43:17Z)
• 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)
• Human strategic decision making in parametrized games [4.264192013842095]
  We present a new framework that enables human decision makers to make fast decisions without the aid of real-time solvers. We demonstrate applicability to a variety of situations including settings with multiple players and imperfect information.
  arXiv  Detail & Related papers  (2021-04-30T03:40:27Z)
• Individualized Context-Aware Tensor Factorization for Online Games Predictions [6.602875221541352]
  We present the Neural Individualized Context-aware Embeddings (NICE) model for predicting user performance and game outcomes. Our proposed method identifies individual behavioral differences in different contexts by learning latent representations of users and contexts. Using a dataset from the MOBA game League of Legends, we demonstrate that our model substantially improves the prediction of winning outcome, individual user performance, and user engagement.
  arXiv  Detail & Related papers  (2021-02-22T20:46:02Z)
• Moody Learners -- Explaining Competitive Behaviour of Reinforcement Learning Agents [65.2200847818153]
  In a competitive scenario, the agent does not only have a dynamic environment but also is directly affected by the opponents' actions. Observing the Q-values of the agent is usually a way of explaining its behavior, however, do not show the temporal-relation between the selected actions.
  arXiv  Detail & Related papers  (2020-07-30T11:30:42Z)

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.