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

1.6%3.1%4.7%6.3% · Feb 202619922001200920172026
48 results for game outcomes

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend on the amount wagered on those outcomes. By varying the `reality map', which rel…

2009-02-01abs ↗pdf ↗

The game theory techniques are used to find the equilibrium of a market. Game theory refers to the ways in which strategic interactions among economic agents produce outcomes with respect to the preferences (or utilities) of those agents, where the outcomes in question might have been intended by none of the agents. Th…

2012-10-23abs ↗pdf ↗

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action a…

2011-02-10abs ↗pdf ↗

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 ↗

We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the other player's goal is to disconnect the shadow. We make significant progress t…

2011-09-19abs ↗pdf ↗

New algorithms optimize decision rules in strategic scenarios, minimizing prediction risk and incentivizing better outcomes.

problem Strategic agents manipulate features to improve outcomes, complicating decision-making models.
method Efficient algorithms for learning decision rules that minimize prediction risk, incentivize better outcomes, and estimate true model coefficients.
result Optimal decision rules can be learned through testing and observing agent responses, circumventing hardness results.

Agents learn to outperform in trading by using past and current prices.

problem Optimal trading performance beyond theoretical limits.
method Two-agent Almgren-Chriss liquidation game, schedule-learning, DDQN architectures.
result Agents with access to past and current prices achieve supra-competitive outcomes.

Financial markets, with their vast range of different investment opportunities, can be seen as a system of many different simultaneous games with diverse and often unknown levels of risk and reward. We introduce generalizations to the classic Kelly investment game [Kelly (1956)] that incorporates these features, and us…

2008-03-10abs ↗pdf ↗

We introduce a new class of context dependent, incomplete information games to serve as structured prediction models for settings with significant strategic interactions. Our games map the input context to outcomes by first condensing the input into private player types that specify the utilities, weighted interactions…

2019-05-29abs ↗pdf ↗

We provide a simple and efficient algorithm for adversarial kk-action dd-outcome non-degenerate locally observable partial monitoring game for which the nn-round minimax regret is bounded by 6(d+1)k3/2nlog(k)6(d+1) k^{3/2} \sqrt{n \log(k)}, matching the best known information-theoretic upper bound. The same algorithm also achieves…

2019-07-12abs ↗pdf ↗

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…

2017-10-05abs ↗pdf ↗

Optimal strategies are found for a repeated betting game using diffusion approximation.

problem Finding optimal strategies for a repeated betting game with i.i.d. outcomes.
method Constructing a diffusion approximation of the repeated game and analyzing the wealth share process.
result Necessary and sufficient conditions for the wealth share process to be transient or recurrent are derived.

Twitter has been proven to be a notable source for predictive modelling on various domains such as the stock market, the dissemination of diseases or sports outcomes. However, such a study has not been conducted in football (soccer) so far. The purpose of this research was to study whether data mined from Twitter can b…

2014-11-05abs ↗pdf ↗

Algorithms are often used to produce decision-making rules that classify or evaluate individuals. When these individuals have incentives to be classified a certain way, they may behave strategically to influence their outcomes. We develop a model for how strategic agents can invest effort in order to change the outcome…

2018-07-13abs ↗pdf ↗

Fair insurance contracts are designed to handle default risk using cooperative game theory.

problem Designing fair insurance contracts in the presence of default risk.
method Cooperative game theory to specify premiums and participation in benefit.
result Fair benefit participation emerges as a game outcome involving residual risks.

Gradient Descent Ascent converges to von-Neumann solution in hidden zero-sum games.

problem Understanding dynamics of zero-sum games with hidden structure.
method Gradient Descent Ascent applied to hidden zero-sum games with specific convex-concave structure.
result Gradient Descent Ascent converges to von-Neumann solution in strictly convex-concave hidden games.

The paper develops classifiers that encourage positive adaptation in machine learning settings.

problem Strategic behavior by decision subjects leads to performance loss in machine learning models.
method Formulates a two-stage game to characterize optimal strategies for model designers and decision subjects.
result Trained classifiers maintain accuracy while inducing higher improvement and less manipulation.

Model-free reinforcement learning (RL) can be used to learn effective policies for complex tasks, such as Atari games, even from image observations. However, this typically requires very large amounts of interaction -- substantially more, in fact, than a human would need to learn the same games. How can people learn so…

2019-03-01abs ↗pdf ↗

No-regret learning fails to converge to Nash equilibria in mixed strategies.

problem Limiting behavior of mixed strategies in repeated games.
method Study of optimal no-regret learning algorithms for 2x2 competitive games.
result Limiting mixed strategies cannot converge to Nash equilibria under mean-based and monotonic updates.

Social learning can make financial markets inefficient, but individual learning can fix this.

problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.

Accurately predicting the outcome of sporting events has been a goal for many groups who seek to maximize profit. What makes this challenging is that the outcome of an event can be influenced by many factors that dynamically change across time. Oddsmakers attempt to estimate these factors by using both algorithmic and …

2017-10-18abs ↗pdf ↗

The study analyzes games and social hierarchies, incorporating luck and depth of competition.

problem Analyzing patterns of wins and losses in games and social hierarchies.
method Generalized probabilistic models incorporating luck and depth of competition.
result Social competition tends to be deeper with many distinct levels, but there is often a chance of upset victories.

We study an original problem of pure exploration in a strategic bandit model motivated by Monte Carlo Tree Search. It consists in identifying the best action in a game, when the player may sample random outcomes of sequentially chosen pairs of actions. We propose two strategies for the fixed-confidence setting: Maximin…

2016-02-15abs ↗pdf ↗

The paper analyzes competition among fund managers using excess logarithmic returns and constructs games to find optimal allocations.

problem Optimal allocation strategies among fund managers considering excess logarithmic returns.
method Constructs both nn-player and mean field games to address the competition problem.
result The MFE of the MFG represents the limit of nn-player game's equilibrium as nn approaches infinity.

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

2014-12-13abs ↗pdf ↗

In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum moves to be orthogonal to all previous moves. We also admit interference effects, by…

2010-07-21abs ↗pdf ↗

Agents trained with reinforcement learning deviate from Nash equilibrium in optimal execution game.

problem Deviation of reinforcement learning strategies from Nash equilibrium in optimal execution game.
method Two-player optimal execution game with reinforcement learning algorithms (Double Deep Q-Learning).
result Strategies learned by agents deviate significantly from Nash equilibrium, exhibiting supra-competitive solutions.

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.

New framework for predicting decisions that influence their own outcomes.

problem Predictions that affect the outcomes they predict, leading to undesirable distribution shift.
method Risk minimization framework combining statistics, game theory, and causality.
result Necessary and sufficient conditions for retraining to converge to a performatively stable point of minimal loss.

The paper analyzes a game where players must balance short-term and long-term interests, leading to cooperative or competitive outcomes.

problem Analyzing time inconsistency in inter-personal decision-making under non-exponential discounting.
method Iterative procedures and Zorn's lemma to find Nash equilibria between players' intra-personal equilibria.
result Inter-personal equilibria exist and depend on the impatience levels of the players.

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.

We investigate a randomization procedure undertaken in real option games which can serve as a basic model of regulation in a duopoly model of preemptive investment. We recall the rigorous framework of [M. Grasselli, V. Leclère and M. Ludkovsky, Priority Option: the value of being a leader, International Journal of Theo…

2013-09-07abs ↗pdf ↗

New framework ensures valid uncertainty estimates for any data stream changes.

problem Challenges of distribution shifts and adversarial actors in real-world data streams.
method Leveraging Blackwell approachability from game theory, the framework guarantees calibrated uncertainties for any compact space.
result Improves calibration and decision-making for energy systems.