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.
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “player behavior”
Game developers forecast player behavior to optimize monetization.
problem Predicting player behavior to ensure successful game development.
method Experimental analysis of forecasting methods, including ARIMA and deep learning.
result Deep learning shows promising results for forecasting player behavior.
This study evaluates methods for clustering mobile game player behavior data.
problem Clustering time series data of player behavior in free-to-play games.
method Evaluation of various similarity measures and dimensionality reduction techniques.
result Identification and validation of temporal patterns of player behavior.
Method predicts NBA players' multi-modal movement trajectories.
problem Understanding NBA players' decision-making during games.
method LSTM-based architecture with multi-modal loss function.
result Method outperforms state-of-the-art in predicting realistic trajectories.
Study long-term asset liquidation behavior with external flows.
problem Investigate optimal liquidation in presence of external flows.
method Convergence analysis of BSDEs for value function and strategy.
result Long-term liquidation may not occur due to external flows.
The in-game economies of massively multi-player online games (MMOGs) are complex systems that have to be carefully designed and managed. This paper presents the results of an analysis of auction house data from the MMOG Glitch, across a 14 month time period, the entire lifetime of the game. The data comprise almost 3 m…
Paper models human motivations in games using inverse RL.
problem Lack of understanding human motivations in game models.
method Multi-Motivation Behavior Modeling (MMBM) using inverse reinforcement learning.
result Reveals significant differences in value structures among player groups.
A model assesses risk decisions in project management and investor behavior.
problem Mathematical assessment of risky decisions in project management.
method A game with two players (Investor and Project Manager) uses past experience and confidence levels to evaluate risky strategies.
result The model helps project managers and investors make better decisions based on risk levels and confidence.
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.
Study herding in finance using particle model.
problem Understanding collective behavior in financial markets.
method Agent-based particle model for non-coordinated interactions and dynamic market signals.
result Gronwall and LaSalle type estimates for herding behavior.
Study improves estimates and extreme value behavior in stochastic differential games.
problem Analyzing the mean-field limit of diffusive games through master equation.
method Using the Master Equation to approximate state processes and establishing estimates for the total error.
result Established asymptotic behavior of upper order statistics of Nash states, initiating Extreme Value Theory for stochastic differential games.
Almost universally, wealth is not distributed uniformly within societies or economies. Even though wealth data have been collected in various forms for centuries, the origins for the observed wealth-disparity and social inequality are not yet fully understood. Especially the impact and connections of human behavior on …
Deep learning agents negotiate contracts with prosocial or selfish behaviors.
problem Training agents to negotiate contracts with varying behaviors.
method Multi-Agent Reinforcement Learning, modeling prosocial and selfish behaviors, training a meta agent.
result Trained agents hold their own against human players and emulate human behavior.
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.
New game design method for better trait inference.
problem Inferring latent psychological traits from human behavior.
method Formulated as a mutual information maximization problem, solved using variational lower bound optimization.
result Designed games successfully distinguish among players with different traits, outperforming traditional methods.
MpFL models clients as strategic players to reach equilibrium with less communication.
problem Real-world clients act independently with individual objectives, not aligned with a shared global model.
method MpFL uses game-theoretic modeling and PEARL-SGD algorithm for local updates and communication.
result PEARL-SGD reaches an equilibrium with less communication than non-local updates in stochastic setup.
Real payoffs and virtual trading in agent based market modelscond-mat.stat-mech
The \$-Game was recently introduced as an extension of the Minority Game. In this paper we compare this model with the well know Minority Game and the Majority Game models. Due to the inter-temporal nature of the market payoff, we introduce a two step transaction with single and mixed group of interacting traders. When…
Novel segmentation method for energy game-theoretic frameworks using graphical lasso.
problem Difficulty in computing utility functions for high-player energy game-theoretic frameworks.
method Graphical Lasso based approach to cluster features leading to energy usage behaviors.
result Characteristic clusters demonstrating different energy usage behaviors identified.
The new framework for finance is proposed. This framework based on three known approaches in econophysics. Assumptions of the framework are the following: 1. For the majority of situations market follows non-arbitrage condition. 2. For the small number of situations market influenced by the actions of big firms. 3. If …
The dynamics of market prices is described as the evolution of opinions in the trading community regarding future market behavior. The price then is a function of the voting process of the market players in favor to raise or reduce the value of a stock. The model presented in this paper is suited for pricing of options…
Mobile game developers use a scalable churn prediction model to predict player abandonment.
problem Predicting player abandonment in mobile games.
method Survival ensembles approach for accurate churn prediction.
result Accurate predictions on player abandonment and playtime.
New game theory approach to bond market liquidity and participant behavior.
problem Uncertainty in market maker types and regulatory structure.
method Liquidity Game theory applied to UK bond market interactions.
result Strategies and structures for market makers and regulators.
Improved multi-player bandit algorithms with various feedback levels.
problem Optimizing multi-player decision-making in cognitive radio systems.
method Introduced algorithms with different feedback levels and provided theoretical and empirical guarantees.
result Empirical and theoretical improvements over existing algorithms.
Multiplayer Online Battle Arena (MOBA) games are among the most played digital games in the world. In these games, teams of players fight against each other in arena environments, and the gameplay is focused on tactical combat. Mastering MOBAs requires extensive practice, as is exemplified in the popular MOBA Defence o…
Paper develops efficient algorithms for learning rationalizable equilibria in multiplayer games.
problem Learning rationalizable behavior in multiplayer games under bandit feedback.
method New algorithms for finding rationalizable Coarse Correlated Equilibria and Correlated Equilibria with polynomial sample complexity.
result Achieved polynomial sample complexity for learning rationalizable equilibria, improving over existing exponential complexity.
Predicting which players will convert to paying users in video games.
problem Retaining premium players in free-to-play games.
method Survival analysis techniques, Cox regression, random survival forest, conditional inference survival ensembles.
result Conditional inference survival ensembles method corrects bias in RSF models and predicts conversion.
We consider models of financial markets in which all parties involved find incentives to participate. Strategies are evaluated directly by their virtual wealths. By tuning the price sensitivity and market impact, a phase diagram with several attractor behaviors resembling those of real markets emerge, reflecting the ro…
Matching Markets meet Cumulative Prospect Theory: Towards Optimal and Adversarially Robust Learningcs.LG
Matching Markets meet Cumulative Prospect Theory: Towards Optimal and Adversarially Robust Learning
problem Multi-agent multi-armed bandit problem in competitive setup with two-sided matching markets under human-centric decision making model
method Using cumulative prospect theory (CPT) to emulate human preferences
result Improved regret guarantees in adversarial markets with CPT as risk-sensitive measure
Model explains periodic trading in financial markets through game theory.
problem Understanding periodic trading activities in financial markets.
method Mean-field liquidation game with major-minor players.
result Existence and uniqueness of Nash equilibrium established.
Gradient-descent-ascent dynamics can exhibit various behaviors in non-convex non-concave games.
problem Gradient-descent-ascent dynamics in non-convex non-concave games can lead to recurrent behavior and spurious equilibria.
method Combines optimization theory, game theory, and dynamical systems.
result Gradient-descent-ascent dynamics can exhibit Poincaré recurrence and converge to spurious equilibria.
Deep neural networks outperform parametric models in predicting customer lifetime value in video games.
problem Predicting the economic value of individual players in free-to-play video games.
method Exploration of deep neural networks and parametric models (Pareto/NBD) for predicting customer lifetime value.
result Convolutional neural networks are the most efficient in predicting the economic value of individual players.
Despite increasing attention paid to the need for fast, scalable methods to analyze next-generation neuroscience data, comparatively little attention has been paid to the development of similar methods for behavioral analysis. Just as the volume and complexity of brain data have grown, behavioral paradigms in systems n…
Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These tech…
This paper analyzes the multi-armed bandit model using path-integral methods.
problem Understanding the stochastic dynamics and optimal strategies in multi-armed bandit problems.
method Path-integral analysis of statistical physics.
result Emergence of multimodal regret distribution with large regrets from exploitation of sub-optimal arms.
In this paper we study the problem of exact recovery of the pure-strategy Nash equilibria (PSNE) set of a graphical game from noisy observations of joint actions of the players alone. We consider sparse linear influence games --- a parametric class of graphical games with linear payoffs, and represented by directed gra…
Paper solves a trading game for stocks that jump and diffuse, finding the Kelly rule is optimal.
problem Trading game for stocks that can jump and diffuse.
method Solves a zero-sum game with a payoff kernel, finding the Kelly rule for jump diffusions.
result The Kelly rule is the optimal strategy for outperforming traders in a trading game.
New trekking approach reduces collisions in multi-player bandits.
problem Stochastic multi-armed bandits with many unknown players.
method Trekking approach to minimize collisions and regret.
result Guaranteed constant and sub-linear regret for static and dynamic scenarios.
Machine learning predicts video game purchases for better player experience.
problem Predicting in-game purchases for free-to-play video games.
method Evaluated and compared two machine learning models: Extremely Randomized Trees and Deep Neural Networks.
result Deep Neural Networks outperformed Extremely Randomized Trees in accuracy and speed for operational settings.
The paper tackles calibrating long-term behaviors with multiple styles using programmatic style-consistency.
problem Generating long-term sequential behaviors with multiple styles simultaneously.
method Leverage programmatic labeling functions to specify controllable styles and derive style-consistency as a learning objective.
result Learned policies can be calibrated for up to 1024 distinct style combinations.
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.
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.
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 algorithm reduces regret in multi-player bandits with collision information.
problem Optimizing decisions in multi-player bandits with collision penalties.
method Developed an algorithm with optimal regret under collision announcements, and sublinear regret without collision info.
result First -type regret guarantee for non-stochastic multi-player multi-armed bandits with collision information.
Paper proposes player roles from match data to help clubs.
problem Difficulty in determining a player's fit for a team's style.
method Identifies 21 player roles from match event data.
result Automatic identification of player roles from match data.
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.
Symmetric game analysis shows Nash equilibria in three strategic states.
problem Analyzing Nash equilibria in a symmetric multi-player zero-sum game with two strategic variables.
method Using the minimax theorem by Sion to show equivalence of Nash equilibria.
result Nash equilibria are equivalent in three strategic states.