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.
Bayesian model improves win probability estimates in soccer.
problem Technical challenges in estimating win probability for soccer.
method Bayesian statistical framework using contextual game state features.
result Well-calibrated win, tie, and loss probabilities demonstrated.
New framework values football players based on in-game interactions.
problem Valuing football players based on in-game performance.
method Combining financial models and network theory using a passing matrix.
result Dynamic and individualized player valuation framework.
Action guidance helps agents learn true objectives in games with sparse rewards.
problem Training agents in games with sparse rewards requires significant exploration.
method Action guidance, a novel technique that combines exploration with reward shaping.
result Action guidance enables agents to optimize true objectives efficiently.
Researchers create a framework to value player actions in CSGO.
problem Lack of accessible data and analytical frameworks for esports players.
method Data model, graph distance measure, context-aware framework.
result Demonstrated framework's consistency and independence compared to existing methods.
New learning dynamics achieve fast convergence in games without needing to know utility scales.
problem Fast convergence guarantees in learning games require prior knowledge of utility scales.
method Developed scale-free and scale-invariant learning dynamics using optimistic follow-the-regularized-leader with adaptive learning rates and clipping techniques.
result Achieved fast convergence rates to Nash and correlated equilibria without prior utility scale knowledge.
The game-theoretic risk management framework put forth in the precursor work "Towards a Theory of Games with Payoffs that are Probability-Distributions" (arXiv:1506.07368 [q-fin.EC]) is herein extended by algorithmic details on how to compute equilibria in games where the payoffs are probability distributions. Our appr…
Transforms game optimization dynamics into frequency domain for precise hyperparameter analysis.
problem Analyzing convergence of hyperparameters in game optimization.
method Frequency-domain framework using High-Resolution Differential Equations (HRDEs) and Laplace transforms.
result Derives precise convergence criteria for the Lookahead algorithm.
Model predicts user engagement and survival time in games.
problem Building data-efficient engagement models for diverse games.
method Data-driven approach using minimal metrics.
result Joint estimates of survival time and churn probability.
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.
New framework compares two stochastic learning dynamics in games.
problem Inability to distinguish between different learning rules leading to the same steady-state behavior.
method Developed a framework for comparative analysis of stochastic learning dynamics with different update rules.
result Identified distinct behaviors in the paths to stochastically stable states for LLL and ML.
A new method assesses algorithmic fairness using game theory.
problem Evaluating algorithmic fairness without proprietary data.
method Cohort Shapley value, a game-theoretic approach.
result Identifies individual impact of protected attributes.
In this paper we study the nonzero-sum Dynkin game in continuous time which is a two player non-cooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we consider the problem of pricing American game contingent claims by the utility maximiza…
New sampling method estimates Shapley values more accurately.
problem Exponential time complexity of computing Shapley values.
method Multilinear sampling algorithm based on game theory.
result Our method reduces variance and provides more accurate Shapley value estimations.
BBE simulates sports betting exchanges for data generation.
problem Creating synthetic data for betting strategy testing.
method Agent-based model (ABM) for sports betting exchange simulation.
result Simulation runs up to 1000 times faster with GPU.
We consider the game-theoretic scenario of testing the performance of Forecaster by Sceptic who gambles against the forecasts. Sceptic's current capital is interpreted as the amount of evidence he has found against Forecaster. Reporting the maximum of Sceptic's capital so far exaggerates the evidence. We characterize t…
CausalGame benchmarks LLM agents' causal thinking in games.
problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.
Paper analyzes convergence rates for multi-agent learning in games.
problem Convergence rates for multi-agent learning in games.
method Characterizes finite-time convergence rates for joint OGD learning on λ-cocoercive games and develops adaptive algorithms. result Adaptive algorithms achieve same convergence rates as non-adaptive counterparts.
Unified analysis of gradient-based methods for finding Nash equilibria in games.
problem Finding Nash equilibria in games using gradient-based methods.
method Unified analysis of extragradient (EG), optimistic gradient (OG), and consensus optimization (CO) methods.
result Unified convergence rates for EG, OG, and CO across different game types.
Study uses time series analysis to predict player churn and conversion in games.
problem Predicting player churn and conversion in free-to-play games.
method State Space time series approach with Autoregressive Integrated Moving Average and Unobserved Components models.
result Unobserved Components approach fails to detect marketing campaigns and predicts abandonment poorly.
New algorithm improves game learning with randomised optimism.
problem Learning in matrix games with unknown payoffs and bandit feedback.
method Integrates evolutionary algorithms into bandit framework for randomised optimism.
result Achieves sublinear regret, outperforming classical methods.
The negative externalities from an individual bank failure to the whole system can be huge. One of the key purposes of bank regulation is to internalize the social costs of potential bank failures via capital charges. This study proposes a method to evaluate and allocate the systemic risk to different countries/regions…
The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as no…
Mixability of a loss is known to characterise when constant regret bounds are achievable in games of prediction with expert advice through the use of Vovk's aggregating algorithm. We provide a new interpretation of mixability via convex analysis that highlights the role of the Kullback-Leibler divergence in its definit…
We consider Blackwell approachability, a very powerful and geometric tool in game theory, used for example to design strategies of the uninformed player in repeated games with incomplete information. We extend this theory to "generalized quitting games" , a class of repeated stochastic games in which each player may ha…
RL enhances cloud autoscaling by learning optimal resource allocation.
problem Optimizing resource allocation in dynamic, uncertain cloud environments.
method Reinforcement Learning for dynamic, transparent, and adaptable resource management policies.
result RL enables transparent, dynamic, and adaptable resource management policies.
Private learning can be used to efficiently solve online learning problems.
problem The relationship between differentially private learning and online learning efficiency.
method Derive an efficient black-box reduction from differentially private learning to online learning from expert advice.
result An efficient differentially private learner implies an efficient online learner.
Study on optimal strategies for minimizing shortfall risk in game options.
problem Existence of optimal hedging strategies for shortfall risk in game options.
method Continuous time Black--Scholes model, finite and infinite exercise times.
result Optimal strategies exist for finite exercise times but not for all time intervals.
Develops a neural model to predict event occurrence and timing.
problem Standard event time models ignore the distinction between event occurrence probability and predicted time.
method Introduces a conditional event time model using a neural network with a binary stochastic layer.
result Shows superior event occurrence and timing predictions on various datasets.
Paper proposes PP-GCN for fine-grained social event categorization.
problem Challenges in mining social events due to heterogeneous event elements and social network structures.
method Design an event meta-schema, build an HIN, propose PP-GCN, and use KIES.
result PP-GCN outperforms other techniques in social event detection and clustering.
Paper proposes a new trading strategy using corporate event detection from news articles.
problem Predicting stock movements based on corporate events from news articles.
method Bi-level event detection model: low-level for token-level event identification, high-level for article-level event identification.
result The proposed strategy outperforms existing models in stock prediction metrics.
Deep learning detects sleep events in EEG, reducing expert dependency.
problem Manual EEG event annotation by sleep experts is time-consuming and variable.
method Convolutional neural network for joint event detection in EEG signals.
result Deep learning method outperforms existing event-specific algorithms.
Proposes a method to predict stock movements using fine-grained events from finance news.
problem Lack of specific semantic information in coarse-grained events for stock movement prediction.
method Built a finance event dictionary, extracted fine-grained events, combined with stock trade data, and used distant supervision for training.
result Method outperforms all baselines and shows good generalizability.
ProxiModel extracts high-quality news events from news corpora.
problem Mining high-quality structured event knowledge from noisy news data.
method ProxiModel uses a proximity-network to model event correlation within and across news corpora.
result ProxiModel efficiently and effectively extracts high-quality event descriptors and attributes.
AUC is unreliable in rare event settings but stable with moderate numbers of events.
problem Misleading performance metrics in rare event settings.
method Simulation study varying dataset sizes and event rates.
result AUC is unreliable in rare event settings but stable with moderate numbers of events.
Non-spanning identification of scheduled event risk in option pricing.
problem Separating continuous surface from scheduled jump in option pricing.
method Modeling FOMC decisions, CPI releases, and NFP reports as deterministic-time jumps in risk-neutral option pricing.
result Improves held-out event-spanning pricing with Gaussian and two-component mixture jumps.
New approach predicts event probabilities for better event detection.
problem Class imbalance and inaccurate event detection in time series analysis.
method Regression-based approach to predict probability densities at event locations.
result Regression-based approaches outperform segmentation-based methods.
Study examines HTE estimation from time-to-event data with competing events.
problem Estimating HTEs from time-to-event data with competing events.
method Outcome modeling approach using plug-in estimators for potential outcomes.
result Competing events introduce new challenges for HTE estimation.
CAUSE learns Granger causality from event sequences, outperforming existing methods.
problem Learning Granger causality from complex, interdependent event sequences.
method CAUSE uses a neural point process to capture interdependency and an attribution method to extract Granger causality.
result CAUSE outperforms state-of-the-art methods in inferring inter-type Granger causality.
New method detects events with keywords, adapting to new types.
problem Adapting event detection to new types with predefined sets.
method Feature-based attention mechanism for CNNs.
result Benefits for new type extension and attention mechanism.
Adversarial model estimates event-time distributions from health data.
problem Nonparametric estimation of event-time distributions in time-to-event analysis.
method Adversarial learning approach with a principled cost function for censored events.
result Proposed model yields significant performance gains over parametric alternatives.
Natural language guides reinforcement learning exploration in games.
problem Improving reinforcement learning in unseen environments.
method Used encoder-decoder networks to learn associations between natural language and state-action information, then applied this to guide agent exploration.
result Modified policy shaping algorithm outperformed Q-learning and baseline policy shaping in Frogger.
REST framework predicts stock trends by considering stock-specific and related-stock events.
problem Predicting stock trends using event information from news, social media, and discussion boards.
method REST framework addresses two main shortcomings of existing event-driven methods: stock-specific event influence and related-stock event influence.
result REST framework achieves higher investment returns compared to baselines.
GANs improve event generation in physics experiments.
problem Improving statistical precision in event generation.
method Used generative adversarial networks (GANs) to generate events.
result GANs amplify the statistical precision of the training sample.
Extracts biological context from biomedical texts to associate with events.
problem Identifying biological context and associating it with biochemical events in texts.
method Analyzed an annotated corpus and developed classifiers using syntactic, distance, and frequency features.
result Developed and evaluated classifiers for context-event association.
New deep learning method handles rare and imbalanced events in time series.
problem Challenges in event detection in time series data, especially rare and imbalanced events.
method Supervised regression-based deep learning approach that handles various types of events.
result Superior performance across diverse domains, particularly for rare events and imbalanced datasets.
Combining multiple collider events improves machine learning performance.
problem Improving machine learning for collider physics.
method Study of single-event vs multi-event classifiers under IID assumption.
result Training single-event classifiers is more effective than multi-event classifiers.
The study uses financial events to predict stock market movements.
problem Predicting stock market movements using financial events.
method Combined event extraction method, BERT/ALBERT enhanced event representation, and extended hierarchical attention network.
result Significantly better accuracies and higher simulated returns compared to state-of-the-art models.