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

55109164218 · Jun 202019922001200920172026
48 results for pure strategies

New findings show pure strategy equilibria are more robust in a war of attrition game.

problem Analyzing a game of war of attrition under complete information.
method Examined the stability of equilibria in pure and mixed strategies under varying payoffs.
result Pure strategy equilibria are more robust to perturbations of the canonical model.

The paper analyzes game theory in convertible contracts during liquidity events.

problem Optimizing payments in convertible contracts during liquidity events.
method Defined a general model for games, showed non-existence of pure strategy Nash equilibria, developed algorithms for computing equilibria.
result Optimum pure strategy Nash equilibria exist when all contracts are of the same type (SAFE).

The paper tackles pure exploration in multi-armed bandits with low rank structure using oblivious sampling.

problem Pure exploration in multi-armed bandits with low rank reward sequences.
method The approach involves separating the exploration strategy from feedback, using oblivious sampling, and incorporating kernel information of reward vectors.
result Efficient algorithms with regret bound O(d(lnN)/n)O(d\sqrt{(\ln N)/n}) for both time-varying and fixed cases, with a lower bound gap of O(lnN)O(\sqrt{\ln N}).

In this paper we use game theory to model poisoning attack scenarios. We prove the non-existence of pure strategy Nash Equilibrium in the attacker and defender game. We then propose a mixed extension of our game model and an algorithm to approximate the Nash Equilibrium strategy for the defender. We then demonstrate th…

2019-06-07abs ↗pdf ↗

This paper develops a mathematical framework for the analysis of continuous-time trading strategies which, in contrast to the classical setting of continuous-time mathematical finance, does not rely on stochastic integrals or other probabilistic notions. Our purely analytic framework allows for the derivation of a path…

2016-02-16abs ↗pdf ↗

Study optimal reinsurance and investment to minimize drawdown risk.

problem Minimizing drawdown risk in a risk model with correlated insurance claims.
method Optimal reinsurance-investment strategy under expected value and variance premium principles, considering per-loss reinsurance and financial market investment.
result Closed-form expressions for optimal reinsurance-investment strategies and value functions.

Framework purifies approximate differential privacy to pure differential privacy.

problem Achieving pure differential privacy from approximate differential privacy.
method Randomized post-processing with calibrated noise to eliminate δ parameter.
result First statistically and computationally efficient reduction from approximate DP to pure DP.

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 ↗

We present a new framework for Hermite fractional financial markets, generalizing the fractional Brownian motion and fractional Rosenblatt markets. Considering pure and mixed Hermite markets, we introduce a strategy-specific arbitrage tax on the rate of transaction volume acceleration of the hedging portfolio as the pr…

2017-09-26abs ↗pdf ↗

We study a specific \textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \textit{for a fixed time horizon}. We propose a parameter-free algorithm based on an original heuristic, and prove…

2016-05-27abs ↗pdf ↗

Investigates market dynamics with informed traders and high-frequency traders.

problem Trading large orders in a market with multiple high-frequency traders.
method Analyzes a three-period Kyle's model with a normal-speed informed trader and multiple anticipatory high-frequency traders under different inventory pressures.
result Surprising results: improving HFTs' speed or prediction can harm them but benefit the informed trader.

We show that which that for a Berwald structure, any Riemannian structure that is preserved by the Berwald connection leaves the indicatrix invariant under horizontal parallel transport. We also obtain the converse result: if (M,F)({\bf M},F) is a Finsler structure such that there exists a Riemannian structure that leaves…

2007-10-16abs ↗pdf ↗

Market making is one of the most important aspects of algorithmic trading, and it has been studied quite extensively from a theoretical point of view. The practical implementation of so-called "optimal strategies" however suffers from the failure of most order book models to faithfully reproduce the behaviour of real m…

2018-06-13abs ↗pdf ↗

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…

2015-08-25abs ↗pdf ↗

Pure exploration (aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mistakes and take few samples. Lower bounds (for multi-armed bandit models with arms in an exponential family) reveal that the sample complexity …

2019-06-25abs ↗pdf ↗

New discrete-time model shows insider trading dynamics.

problem Modeling insider trading with discrete time and noise traders.
method Formulated as a game with three types of traders, including an insider, noise traders, and a market maker. Proved existence of sequential Kyle equilibrium for various distributions and information flows.
result Equilibria exist in mixed strategies but not in pure strategies, unlike in Kyle's original model.

We propose the first fully-adaptive algorithm for pure exploration in linear bandits---the task to find the arm with the largest expected reward, which depends on an unknown parameter linearly. While existing methods partially or entirely fix sequences of arm selections before observing rewards, our method adaptively c…

2017-10-16abs ↗pdf ↗

In several realistic situations, an interactive learning agent can practice and refine its strategy before going on to be evaluated. For instance, consider a student preparing for a series of tests. She would typically take a few practice tests to know which areas she needs to improve upon. Based of the scores she obta…

2017-06-07abs ↗pdf ↗

We argue that the existing regret matchings for Nash equilibrium approximation conduct "jumpy" strategy updating when the probabilities of future plays are set to be proportional to positive regret measures. We propose a geometrical regret matching which features "smooth" strategy updating. Our approach is simple, intu…

2019-08-18abs ↗pdf ↗

Study optimal liquidation strategies in lit and dark pools with and without regulation.

problem Optimal liquidation strategies in dark and lit pools with execution uncertainty.
method Design optimal make-take fee policies, solve HJB-Fokker-Planck systems, use BSDEs.
result Explicit solutions for optimal strategies in both competitive and regulated markets.

Study optimal strategy for maximizing exponential utility in financial market with linear price impact.

problem Maximizing exponential utility in financial market with linear price impact.
method Purely probabilistic approach using duality.
result Computed optimal portfolio strategy and value for Ornstein-Uhlenbeck process.

This paper studies an environment of simultaneous, separate, first-price auctions for complementary goods. Agents observe private values of each good before making bids, and the complementarity between goods is explicitly incorporated in their utility. For simplicity, a model is presented with two first-price auctions …

2013-12-10abs ↗pdf ↗

The choice of admissible trading strategies in mathematical modelling of financial markets is a delicate issue, going back to Harrison and Kreps (1979). In the context of optimal portfolio selection with expected utility preferences this question has been a focus of considerable attention over the last twenty years. We…

2009-10-20abs ↗pdf ↗

We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges. Given the strategy choices of all agents, a maximal circulation that adheres to the…

2019-08-05abs ↗pdf ↗

The performance of trend following strategies can be ascribed to the difference between long-term and short-term realized variance. We revisit this general result and show that it holds for various definitions of trend strategies. This explains the positive convexity of the aggregate performance of Commodity Trading Ad…

2016-07-08abs ↗pdf ↗

We present in this article a family of new combinatorial identities via purely differential/complex geometry methods, which include as a speical case a unified and explicit formula for Chern numbers of all complex flag manifolds. Our strategy is to construct concrete circle actions with isolated fixed points on these m…

2017-02-06abs ↗pdf ↗

New exploration bonuses improve reinforcement learning efficiency.

problem Efficient exploration in unknown environments with limited feedback.
method Improved exploration bonuses scaling with 1/n and improved stopping time analysis.
result Faster learning rates and improved sample complexity in pure-exploration settings.

Macroscopic price evolution models are commonly used for investment strategies. There are first promising achievements in defining microscopic agent based models for the same purpose. Microscopic models allow a deeper understanding of mechanisms in the market than the purely phenomenological macroscopic models, and thu…

2011-03-28abs ↗pdf ↗

The paper optimizes insurance strategies for two collaborating business lines.

problem Maximizing dividends and managing risk for two collaborating business lines.
method Closed-form solutions for optimal strategies, including dividend payout, reinsurance, and capital injection.
result Optimal strategies involve pure excess-of-loss reinsurance and transferring reserves to prevent ruin.

The paper analyzes how to combine self-protection and self-insurance for risk reduction.

problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.

A general framework is suggested to describe human decision making in a certain class of experiments performed in a trading laboratory. We are in particular interested in discerning between two different moods, or states of the investors, corresponding to investors using fundamental investment strategies, technical ana…

2013-06-09abs ↗pdf ↗

Shai-am simplifies ML for finance, solving code structure and scalability issues.

problem Challenges in integrating ML for investment strategies, including code structure and scalability.
method Integrates a Python framework with modern open-source technologies to manage containerized pipelines and unified interfaces.
result Facilitates collaborative work in quantitative finance by enhancing reusability and readability.