Predict player lifetime value based on engagement metrics.
problem User profiling in video games.
method Survival curves, deep learning, long short-term memory.
result Deep learning predicts player lifetime value.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,878 papers · 148 categories
Trend · papers per month
48 results for “player engagement”
In this paper we present the first results of a pilot experiment in the capture and interpretation of multimodal signals of human experts engaged in solving challenging chess problems. Our goal is to investigate the extent to which observations of eye-gaze, posture, emotion and other physiological signals can be used t…
Modelling Early User-Game Interactions for Joint Estimation of Survival Time and Churn Probabilitycs.LG
Data-driven approaches which aim to identify and predict player engagement are becoming increasingly popular in games industry contexts. This is due to the growing practice of tracking and storing large volumes of in-game telemetries coupled with a desire to tailor the gaming experience to the end-user's needs. These a…
Study analyzes player churn and purchasing behavior in games.
problem Retaining players and predicting churn in video games.
method Deep behavioral analysis and ensemble learning models.
result Discarding certain churners improves prediction models.
Understanding player behavior is fundamental in game data science. Video games evolve as players interact with the game, so being able to foresee player experience would help to ensure a successful game development. In particular, game developers need to evaluate beforehand the impact of in-game events. Simulation opti…
Proposes a novel path generation and evaluation method for video games.
problem Generating and evaluating realistic navigation paths for video games.
method Combines nonparametric model-free transformations and copula models.
result Demonstrates precise and interpretable generation of diverse navigation paths.
Retaining premium players is key to the success of free-to-play games, but most of them do not start purchasing right after joining the game. By exploiting the exceptionally rich datasets recorded by modern video games--which provide information on the individual behavior of each and every player--survival analysis tec…
Deep learning investigation for chess player attention prediction using eye-tracking and game datastat.ML
This article reports on an investigation of the use of convolutional neural networks to predict the visual attention of chess players. The visual attention model described in this article has been created to generate saliency maps that capture hierarchical and spatial features of chessboard, in order to predict the pro…
Study combines chit-chat and goal-oriented dialogue in fantasy games.
problem Combining naturalistic chit-chat with goal-oriented tasks in fantasy games.
method Trained a goal-oriented model with reinforcement learning against an imitation-learned chit-chat model using two approaches.
result Both models outperform a baseline and can converse naturally to achieve goals.
A test measures artificial agents' human-like behavior in video games.
problem Measuring the believability of artificial agents' human-like behavior.
method Developed a non-parametric two-sample hypothesis test.
result The -value correlates with human judgment of human-like behavior.
Effects of income redistribution on the evolution of cooperation in spatial public goods gamesphysics.soc-ph
Income redistribution is the transfer of income from some individuals to others directly or indirectly by means of social mechanisms, such as taxation, public services and so on. Employing a spatial public goods game, we study the influence of income redistribution on the evolution of cooperation. Two kinds of evolutio…
Operationalizes engagement as human behavior, linking theory and data.
problem Fuzziness of engagement concept.
method Formal framework, Melchoir Model, model comparison, theory-driven hypothesis.
result Engagement can be shaped and interpreted using data-driven methods.
New algorithm finds Nash equilibrium in multi-agent games.
problem Extending RL theory to multi-agent settings with large state spaces.
method Proposes an algorithm using an exploiter to find Nash equilibrium policies.
result Proves finding Nash equilibrium is possible with polynomial samples.
An informed broker optimizes trading strategies in a market influenced by many traders.
problem Optimizing trading strategies for an informed broker in a market with many traders.
method Developed a mean-field game approach to derive equilibrium strategies for both the broker and traders.
result The broker's optimal strategy involves a Stackelberg equilibrium, leading and traders following.
Blockchain fan tokens boost sports fan engagement by 50%.
problem Low fan engagement in sports decisions.
method Analyzed 3,576 fan token polls to identify determinants of participation.
result Fan tokens engage 4,003 participants per poll, 50% of token holders.
Towards the global vision of engagement of Generation Z at the workplace: Mathematical modelingecon.GN
Mathematical models reveal key factors for engaging Gen Z at work.
problem Understanding and improving engagement of Generation Z employees.
method Correlation and cluster analyses on engagement surveys.
result Clear responsibilities and challenging work are essential for Gen Z employees.
Paper proposes a method to aggregate customer engagement data for better ranking of e-commerce results.
problem Cold start problem and under-representation of new or under-impressed products in e-commerce search results.
method Aggregates customer engagements within a day for the same query as input training data for machine learning models.
result Training models on aggregated data leads to better ranking of new and under-impressed products.
FATE predicts user engagement on social apps with explainable explanations.
problem Accurate user engagement prediction for social apps with explainability.
method FATE, a flexible neural framework incorporating friendships, actions, and temporal dynamics.
result FATE outperforms state-of-the-art approaches by 10% error and 20% runtime reduction.
Study shows impersonators generate fake engagement on Instagram.
problem Impersonators exploit Instagram for fake engagement.
method Examined three communities (Politician, News agency, Sports star) on Instagram, collected data on 4.8K comments and 2.6K likes from 3.8K impersonators over 7 months.
result Impersonators generate significant fake engagement on verified accounts.
Study improves engagement prediction in educational videos.
problem Addressing cold-start problem in educational recommenders.
method Introduced VLE dataset with content and engagement features, conducted experiments.
result VLE dataset leads to better engagement prediction models.
VLEngagement: A Dataset of Scientific Video Lectures for Evaluating Population-based Engagementcs.CY
A dataset for evaluating engagement with scientific video lectures.
problem Challenges in managing learning resources due to rapid creation of video lectures.
method Introduction of VLEngagement dataset with content-based and video-specific features, and metrics related to user engagement.
result The largest and most diverse publicly available dataset for understanding context-agnostic engagement in video lectures.
Characterizing and Forecasting User Engagement with In-app Action Graph: A Case Study of Snapchatcs.LG
While mobile social apps have become increasingly important in people's daily life, we have limited understanding on what motivates users to engage with these apps. In this paper, we answer the question whether users' in-app activity patterns help inform their future app engagement (e.g., active days in a future time w…
We propose a multimodal approach for detection of students' behavioral engagement states (i.e., On-Task vs. Off-Task), based on three unobtrusive modalities: Appearance, Context-Performance, and Mouse. Final behavioral engagement states are achieved by fusing modality-specific classifiers at the decision level. Various…
Topologically and geometrically engaging actions have proved to be useful to obtain rigidity results for semisimple Lie group actions. We show that the action of a simple noncompact Lie group on a compact manifold preserving a unimodular rigid geometric structure of algebraic type (e.g. a connection together with a vol…
The health outcomes of high-need patients can be substantially influenced by the degree of patient engagement in their own care. The role of care managers includes that of enrolling patients into care programs and keeping them sufficiently engaged in the program, so that patients can attain various goals. The attainmen…
To investigate the detection of students' behavioral engagement (On-Task vs. Off-Task), we propose a two-phase approach in this study. In Phase 1, contextual logs (URLs) are utilized to assess active usage of the content platform. If there is active use, the appearance information is utilized in Phase 2 to infer behavi…
AlphaZero assesses new chess variants for balance and dynamics.
problem Designing engaging and balanced game rules, especially for chess variants.
method Used AlphaZero to learn near-optimal strategies for nine chess variants.
result AlphaZero reveals novel strategic and tactical patterns in chess variants.
New framework optimizes for 'value' rather than engagement.
problem Gap between engagement signals and desired notion of 'value'.
method Measurement theory framework, latent variable model, qualitative evaluation.
result Operationalizes and optimizes for a desired notion of 'value'.
UAVs use RL to outperform a greedy shooter in 2D engagements.
problem Optimizing UAV pursuit-evasion strategies in 2D environments.
method Reinforcement learning applied to a greedy shooter strategy in a 2D aerial engagement.
result Deep Q-learning UAV outperforms greedy shooter UAV in simulations.
D2KLab's approach predicts tweet engagement using two stages.
problem Predicting user engagement with tweets.
method Two-stage approach: feature learning and ensemble XGBoost.
result Ranked 22 in the 2020 RecSys Challenge leaderboard.
Paper uses user engagement signals to automatically label training data for AI assistants.
problem Lack of annotated training data for AI assistants.
method Leverages user engagement signals for unsupervised entity labeling and data augmentation.
result Significant accuracy gains in sequence labeling tasks and user-facing results.
Study analyzes factors influencing healthcare providers' engagement with SMS campaigns.
problem Understanding what drives healthcare providers to engage with SMS campaigns.
method Used logistic regression, random forest, and neural network models to analyze data.
result Identified key factors influencing engagement with SMS campaigns.
Study user engagement in mobile health apps for health workers in resource-poor settings.
problem Detect churn and tailor content for health workers in mobile health apps.
method Probabilistic and survival analysis of behavioral logs.
result Personalized measures of meaningful engagement can enhance health outcomes.
Twitter releases dataset to study user engagement on Home Timeline, focusing on privacy.
problem Limited exploration of user feedback on Twitter's Home Timeline.
method Release of a large-scale dataset of 160 million Tweets with engagement information.
result Demonstrates challenges in predicting user engagements and privacy concerns.
We study stochastic multi-armed bandits with many players. The players do not know the number of players, cannot communicate with each other and if multiple players select a common arm they collide and none of them receive any reward. We consider the static scenario, where the number of players remains fixed, and the d…
We consider a symmetric multi-players zero-sum game with two strategic variables. There are players, . Each player is denoted by . Two strategic variables are and , . They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…
Decentralized Heterogeneous Multi-Player Multi-Armed Bandits with Non-Zero Rewards on Collisionscs.LG
A policy for near-optimal multi-player bandits with non-zero collision rewards.
problem Decentralized multi-player bandits with heterogeneous rewards and collisions.
method A policy achieving near-optimal regret in a non-communicative setting.
result Near order-optimal expected regret of for .
A multi-player bandit system resists adversarial attacks with near-optimal regret.
problem Adversaries attempt to manipulate rewards in a multi-player multi-armed bandit game.
method Players communicate a single bit to resist attacks, achieving near-optimal regret.
result Achieves near-optimal regret of , where is the total time of adversarial attacks.
The Web has enabled one of the most visible recent developments in education---the deployment of massive open online courses. With their global reach and often staggering enrollments, MOOCs have the potential to become a major new mechanism for learning. Despite this early promise, however, MOOCs are still relatively u…
We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to the other player's action. In the first part of the paper, we consider the game wh…
New algorithms for n-player games using a player-centered approach.
problem Learning near-perfect strategies in multiplayer games.
method Player-centered reinforcement learning with Final Adaptation RL.
result FARL is crucial for achieving near-perfect strategies in various games.
New algorithm for multi-player bandits with selfish players, achieving logarithmic regret.
problem Challenges of robustness to selfish players in multi-player bandits.
method First algorithm robust to selfish players achieving logarithmic regret, with or without collision observation.
result Achieved logarithmic regret for robust algorithms to selfish players in multi-player bandits.
We develop a machine learning approach to represent and analyze the underlying spatial structure that governs shot selection among professional basketball players in the NBA. Typically, NBA players are discussed and compared in an heuristic, imprecise manner that relies on unmeasured intuitions about player behavior. T…
Paper uses Apprenticeship Learning to model player behavior in interactive narratives.
problem Understanding and simulating player behavior in interactive narratives.
method Receding Horizon IRL (RHIRL) to learn reward functions and policies.
result RHIRL can learn action sequences and generate behavior similar to specific players.
New algorithm tackles multi-player bandit problems with limited access to arms.
problem Limited access to dynamic local subsets of arms in multi-player multi-armed bandit problems.
method Adopted Upper Confidence Bound (UCB) for exploration-exploitation and distributed optimization for collisions.
result Proposes a decentralized algorithm with near-optimal regret guarantee.
Paper presents Transfer Portal model for accurate player performance predictions.
problem Predicting future player performance after a transfer.
method Personalized neural network and Bayesian updating framework.
result Model generates accurate predictions for player performance at new clubs.
A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.
problem Malicious players colliding with cooperative players to prevent rewards.
method Decentralized and robust algorithm RESYNC for defenders.
result RESYNC algorithm is order-optimal, performing gracefully as the number of collisions increases.
Study predicts soccer player market values using machine learning and SHAP for interpretability.
problem Predicting accurate market values for professional soccer players.
method Ensemble machine learning models, SHAP for interpretability, Boruta for feature selection.
result GBDT model achieved high predictive accuracy (R-squared 0.901, RMSE 3,221,632.175).