Research
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,695 papers · 148 categories

Trend · papers per month

71141212282 · Jun 202019922001200920172026
48 results for statistical games

We study the relationship between social media output and National Football League (NFL) games, using a dataset containing messages from Twitter and NFL game statistics. Specifically, we consider tweets pertaining to specific teams and games in the NFL season and use them alongside statistical game data to build predic…

2013-10-25abs ↗pdf ↗

Paper resolves bias in ALFT training using generalized alignment games.

problem Systematic bias in estimating logarithmic rewards from small batches.
method Generalized Distributional Alignment Games, U-statistics, minimax polynomial estimators, Variance-Optimal Augmented Polynomial Optimization Program (AQP) Estimator.
result Proves optimal bias and accelerated convergence in ALFT training.

New framework recovers reward and rationality parameters from game behavior.

problem Statistical ambiguity in identifying reward and rationality parameters in competitive games.
method Blind Inverse Game Theory (Blind-IGT) using entropy-regularized Quantal Response Equilibrium and Normalized Least Squares (NLS) estimator.
result Optimal convergence rate of O(N1/2)\mathcal{O}(N^{-1/2}) for joint parameter recovery.

Develops a framework to estimate NBA player salary ROI.

problem Measuring the relative return of player salaries in NBA.
method Five-part framework: GCP measure, SGV calculation, cash flow series, ROI calculation.
result Illustrates framework with 2022-2023 NBA data, showing top and bottom performers.

New framework connects online learning to statistical learning for better generalization bounds.

problem Deriving generalization bounds for statistical learning algorithms.
method Constructing an online learning game and showing a connection to statistical learning.
result Established a connection between online and statistical learning, leading to new generalization bounds.

New algorithm finds near-optimal policies efficiently in zero-sum games.

problem Lack of provable efficiency guarantees for policy optimization in zero-sum games.
method Policy optimization algorithm with function approximation.
result Proves efficient convergence to near-optimal policies with polynomial samples and iterations.

GeoShapley uses game theory to measure spatial effects in ML models.

problem Measuring the impact of location on machine learning model predictions.
method Extends Shapley value framework to quantify spatial effects in various ML models.
result Validated GeoShapley values against known processes and demonstrated utility in house price modeling.

A brief review is given of the minority game, an idealized model stimulated by a market of speculative agents, and its complex many-body behaviour. Particular consideration is given to analytic results for the model rather than discussions of its relevance in real-world situations.

2005-12-14abs ↗pdf ↗

Proves minimax sample complexity for turn-based stochastic games.

problem Proving theoretical guarantees for reinforcement learning in turn-based stochastic games.
method Developing absorbing TBSG and reward perturbation techniques to handle statistical dependence.
result Empirical Nash equilibrium strategy approximates true Nash equilibrium in turn-based stochastic games.

In this paper I give a brief introduction to a family of simple but non-trivial models designed to increase our understanding of collective processes in markets, the so-called Minority Games, and their non-equilibrium statistical mathematical analysis. Since the most commonly studied members of this family define disor…

2002-05-13abs ↗pdf ↗

A family of replicator-like dynamics, called the escort replicator equation, is constructed using information-geometric concepts and generalized information entropies and diverenges from statistical thermodynamics. Lyapunov functions and escort generalizations of basic concepts and constructions in evolutionary game th…

2009-11-09abs ↗pdf ↗

A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.

problem Optimizing parameters of finite mixture models of Bernoulli and categorical distributions.
method Mean Field Games theory applied to multi-population systems.
result The Mean Field Games approach provides a method to compute mixture model parameters.

In-game win probability models, which provide a sports team's likelihood of winning at each point in a game based on historical observations, are becoming increasingly popular. In baseball, basketball and American football, they have become important tools to enhance fan experience, to evaluate in-game decision-making,…

2019-06-12abs ↗pdf ↗

Study on learning strategies in adaptive Markov games with policy regret as metric.

problem Learning in dynamic Markov games with adaptive opponents is challenging.
method Introduced policy regret as a new learning metric and developed algorithms for consistent adaptive adversaries.
result Achieved T\sqrt{T} policy regret against certain adaptive adversaries.

IGGP learns game rules from varying quality game play, finding no overall trend.

problem Learn game rules from varying quality game play.
method Used Sancho's intelligent game traces and ILP systems (Metagol, Aleph, ILASP) to induce game rules from traces of varying quality and volume.
result No overall trend in accuracy of learned game rules from varying quality and volume of training data.

RL in MFGs is as hard as solving many single-agent RL problems.

problem Learning Nash Equilibrium in Mean-Field Games (MFGs).
method Introduce P-MBED to measure model complexity, develop a novel exploration strategy, and establish polynomial sample complexity results.
result Learning Nash Equilibrium in MFGs is no more statistically challenging than solving a logarithmic number of single-agent RL problems.

We analyze the relationships between game theory and quantum mechanics and the extensions to statistical physics and information theory. We use certain quantization relationships to assign quantum states to the strategies of a player. These quantum states are contained in a density operator which describes the new quan…

2006-09-11abs ↗pdf ↗

Method learns statistics of return distributions via neural networks and maximum mean discrepancy.

problem Learning probability distributions in reinforcement learning.
method Maximum mean discrepancy (MMD) for learning unrestricted statistics of return distributions.
result Method outperforms standard distributional RL baselines on Atari games.

A game-theoretic approach selects features by testing their marginal contributions.

problem Feature selection in econometric and statistical models.
method A coalitional game where features are players and payoff is model performance. Hypothesis test decides feature relevance.
result The approach significantly outperforms existing methods in simulations.

Algorithm minimizes regret and converges to equilibria in Markov games.

problem Regret minimization and convergence to equilibria in general-sum Markov games under adversarial opponents.
method Decentralized algorithm that uses policy optimization and controls path length to achieve sublinear regret.
result Sublinear regret guarantees for convergence to correlated equilibrium in Markov games.

Financial markets are often driven by latent factors which traders cannot observe. Here, we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage, where all agents filter the latent states of the world, and their trading actions hav…

2018-03-12abs ↗pdf ↗

Unified framework for feature-based explanations using ANOVA and game theory.

problem Differences between feature-based explanations methods limit their applicability.
method Introduces a unified framework combining fANOVA and cooperative game theory.
result Uncovered similarities and differences between various explanation techniques.

We consider online learning in an adversarial, non-convex setting under the assumption that the learner has an access to an offline optimization oracle. In the general setting of prediction with expert advice, Hazan et al. (2016) established that in the optimization-oracle model, online learning requires exponentially …

2018-10-17abs ↗pdf ↗

Study uses complex networks and machine learning to predict soccer match outcomes.

problem Predicting soccer match outcomes with complex networks and machine learning.
method Complex network metrics and match statistics were used to build machine learning models.
result Models based on passing networks were as effective as traditional models using match statistics.

This paper connects deep neural networks to game theory, revealing their congestion game properties.

problem Understanding the behavior of deep neural networks using game theory.
method Analyzing deep neural networks as congestion games and applying game theory results.
result Deep neural networks exhibit congestion game properties, linking them to game theory.

Maximizing product use is a central goal of many businesses, which makes retention and monetization two central analytics metrics in games. Player retention may refer to various duration variables quantifying product use: total playtime or session playtime are popular research targets, and active playtime is well-suite…

2017-01-04abs ↗pdf ↗

Framework for games with uncertain parameters, ensuring no player can improve by changing strategy.

problem Non-cooperative games with globally uncertain parameters and no common prior.
method Mixed strategies and subjective priors, Extended Equilibrium defined by fixed-point argument.
result Existence of Extended Equilibrium under certain conditions.

Study on multi-agent decision making complexity, showing sample efficiency gaps.

problem Understanding sample efficiency in multi-agent decision making.
method General framework for interactive decision making, focusing on equilibrium computation.
result No 'reasonable' complexity measure can close gaps between single and multiple agents.

New bounds on learning from multiple distributions for VC classes.

problem Understanding the sample complexity of learning from multiple data distributions.
method Analyzing the gap between known upper and lower bounds for PAC-learnable classes.
result Recent progress on sample complexity for VC dimension d classes on k distributions.

A new MFG framework for evolving clusters from Gaussian mixtures.

problem Evolutionary clustering of time-dependent Gaussian mixtures.
method Control-theoretic framework based on Mean Field Games (MFG) with coupled HJB and Fokker-Planck systems.
result MFG dynamics recover classical EM algorithm trajectories with mass conservation.

New method attributes feature uncertainty in ML models using cooperative game theory.

problem Lack of feature-level uncertainty attribution in explainable AI.
method Proposes a novel, model-agnostic uncertainty attribution method using cooperative game theory and conformal prediction.
result Demonstrates improved runtime efficiency and practical utility in real-world applications.

Study improves LL^{\infty} 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 LL^{\infty} estimates for the total error.
result Established NoN o \infty asymptotic behavior of upper order statistics of Nash states, initiating Extreme Value Theory for stochastic differential games.

This work tackles learning Markov games with adversarial opponents and achieves both average reward and exploitation.

problem Achieving both average reward and exploiting adaptive opponents in Markov games.
method Develops efficient algorithms and proves hardness results for learning Markov games with adversarial opponents.
result Achieves K\sqrt{K}-regret bounds for certain conditions on opponent policies, complemented by an exponential lower bound.