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

Trend · papers per month

2457 · Oct 201919922001200920172026
48 results for game-theoretic

The paper explores game-theoretic alignment of LLMs with human preferences, finding limitations and conditions.

problem Aligning LLMs with human preferences using game theory.
method Systematic study of payoff choices in a two-player zero-sum game for desirable alignment properties.
result Impossibility of preference matching in game-theoretic LLM alignment under standard assumptions.

Game-theoretic models predict asset prices in financial markets.

problem Understanding price formation in financial markets with limited liquidity.
method Developed game-theoretic models for many-person and mean-field games, derived analytical formulas, and numerically assessed results.
result The derived price converges to the mean-field counterpart under specific conditions.

Game-theoretic model captures investor interactions for stock price forecasting.

problem Complex market dynamics driving stock price movements.
method Game-theoretic modeling of heterogeneous investor interactions in a dynamic graph structure.
result Our method outperforms state-of-the-art stock price forecasting methods.

One often finds in the literature connections between measures of fairness and measures of feature importance employed to interpret trained classifiers. However, there seems to be no study that compares fairness measures and feature importance measures. In this paper we propose ways to evaluate and compare such measure…

2019-10-12abs ↗pdf ↗

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…

2010-05-11abs ↗pdf ↗

A game-theoretic framework identifies influential hyperparameters for neural networks.

problem Understanding which hyperparameters are most important for neural network performance.
method Employing Shapley Effects for global sensitivity analysis and Pareto front sets for identifying effective configurations.
result Reveals which hyperparameters are most influential for different objectives in neural networks.

In this article we consider a game theoretic approach to the Risk-Sensitive Benchmarked Asset Management problem (RSBAM) of Davis and Lleo \cite{DL}. In particular, we consider a stochastic differential game between two players, namely, the investor who has a power utility while the second player represents the market …

2015-03-05abs ↗pdf ↗

We study the origins of the dt\sqrt{dt} effect in finance and SDE. In particular, we show, in the game-theoretic framework, that market volatility is a consequence of the absence of riskless opportunities for making money and that too high volatility is also incompatible with such opportunities. More precisely, riskles…

2018-02-04abs ↗pdf ↗

This paper establishes a non-stochastic analogue of the celebrated result by Dubins and Schwarz about reduction of continuous martingales to Brownian motion via time change. We consider an idealized financial security with continuous price path, without making any stochastic assumptions. It is shown that typical price …

2009-04-28abs ↗pdf ↗

We solve a continuous-time game-theoretic problem for Kihlstrom-Mirman preferences.

problem Dynamic inconsistency in preferences due to multiattribute utility theory.
method Formalized an equilibrium control theory for continuous-time Markov processes.
result Equilibrium strategy and value function as solution to extended HJB system.

The paper analyzes how mutable blockchain protocols affect miner behavior and strategic stability.

problem The mutability of blockchain protocols undermines long-term planning and cooperative equilibria.
method Integrates Austrian capital theory with repeated game theory to examine miner behavior under different institutional conditions.
result Effective time preference increases when protocol rules are mutable, leading to political rent-seeking and undermining strategic coherence.

Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we propose an actor-critic reinforcement learning algorithm that provably converges t…

2014-12-01abs ↗pdf ↗

End-to-end model predicts multiagent trajectories using game theory and neural nets.

problem Predicting trajectories of interacting agents in complex scenarios.
method Hybrid neural net with game-theoretic reasoning, using implicit layers to map preferences to Nash equilibria.
result Trains an interpretable model that predicts future trajectories and transfers to decision making.

Unsupervised domain adaptation (UDA) amounts to assigning class labels to the unlabeled instances of a dataset from a target domain, using labeled instances of a dataset from a related source domain. In this paper, we propose to cast this problem in a game-theoretic setting as a non-cooperative game and introduce a ful…

2019-05-06abs ↗pdf ↗

Paper analyzes adversarial attacks and defenses using game theory.

problem Unclear conditions for optimal attacks and defenses in adversarial learning.
method Game-theoretic framework with locally linear decision boundary model.
result Fast Gradient Method attack and Randomized Smoothing defense form a Nash Equilibrium.

For a monotonically advancing front, the arrival time is the time when the front reaches a given point. We show that it is twice differentiable everywhere with uniformly bounded second derivative. It is smooth away from the critical points where the equation is degenerate. We also show that the critical set has finite …

2015-01-30abs ↗pdf ↗

Proposes CoPO, a new policy optimization method for competitive games.

problem Designing efficient optimization methods for competitive Markov decision processes.
method Competitive policy optimization (CoPO) approach that exploits game-theoretic nature of competitive games.
result Stable optimization, convergence to sophisticated strategies, and higher scores compared to baseline methods.

Decentralised optimisation tasks are important components of multi-agent systems. These tasks can be interpreted as n-player potential games: therefore game-theoretic learning algorithms can be used to solve decentralised optimisation tasks. Fictitious play is the canonical example of these algorithms. Nevertheless fic…

2013-01-15abs ↗pdf ↗

It is now well known that decentralised optimisation can be formulated as a potential game, and game-theoretical learning algorithms can be used to find an optimum. One of the most common learning techniques in game theory is fictitious play. However fictitious play is founded on an implicit assumption that opponents' …

2011-12-11abs ↗pdf ↗

Despite the notable successes in video games such as Atari 2600, current AI is yet to defeat human champions in the domain of real-time strategy (RTS) games. One of the reasons is that an RTS game is a multi-agent game, in which single-agent reinforcement learning methods cannot simply be applied because the environmen…

2019-02-06abs ↗pdf ↗

This work presents a game-theoretic method for AVs that handles imperfect communication and individual rewards.

problem Real-time, imperfect communication and individual rewards in multi-agent interactions.
method Game-theoretic approach that allows for imperfect communication and individual rewards.
result More realistic assumptions lead to better reward inference and prediction of future actions.

Selection of input features such as relevant pieces of text has become a common technique of highlighting how complex neural predictors operate. The selection can be optimized post-hoc for trained models or incorporated directly into the method itself (self-explaining). However, an overall selection does not properly c…

2019-10-28abs ↗pdf ↗

This work develops secure distributed algorithms for machine learning to protect against data poisoning and network attacks.

problem Vulnerability of distributed machine learning algorithms to cyber threats.
method Game-theoretic framework to capture conflicting goals of a learner and an attacker, iterative distributed algorithm.
result Distributed SVM is prone to fail in different types of attacks, with impact depending on network structure and attack capabilities.

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

The study compares different game-theoretic attribution methods and finds that interventional Shapley values yield less consistent results than Aumann-Shapley due to path symmetry.

problem Investigating the influence of path choice on game-theoretic attribution algorithms.
method Comparative analysis of interventional Shapley values and Generalized Integrated Gradients (GIG) methods.
result Interventional Shapley values yield less consistent attributions than Aumann-Shapley due to path symmetry and extended away from the training data manifold.

This work shows how evaluation metrics can be seen as fair gambles.

problem The relationship and evaluation of machine learning forecasts.
method Using game-theoretic probability, the authors show evaluation metrics as fair gambles.
result Standard evaluation metrics are fair gambler outcomes, with calibration and regret metrics on two dimensions.

A new definition of events of game-theoretic probability zero in continuous time is proposed and used to prove results suggesting that trading in financial markets results in the emergence of properties usually associated with randomness. This paper concentrates on "qualitative" results, stated in terms of order (or or…

2007-12-08abs ↗pdf ↗

A new game-theoretic approach balances downside risk with expected reward.

problem Traditional game theory views risk only from the upside perspective, ignoring downside risk.
method Introduces downside risk aware equilibria (DRAE) based on lower partial moments.
result Successfully finds equilibria that balance downside risk with expected reward.

Develops a game-theoretic approach to solve SGEP efficiently.

problem Efficiently solving the symmetric generalized eigenvalue problem for large datasets.
method Formulates SGEP as a Nash equilibrium in a game-theoretic context and develops a parallelizable algorithm.
result Achieves O(dk)O(dk) runtime complexity, making it feasible for large-scale problems.

Interval bankruptcy problems arise in situations where an estate has to be liquidated among a fixed number of creditors and uncertainty about the amounts of the claims is modeled by intervals. We extend in the interval setting the classical results by Curiel, Maschler and Tijs (1987) that characterize division rules wh…

2013-01-07abs ↗pdf ↗