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.

169,051 papers · 148 categories

Trend · papers per month

3.4%6.9%10.3%13.8% · May 201619922001200920182026
48 results for stochastic delay game

Proposes a deep learning method for solving complex financial games with delays.

problem Financial modeling with multi-agent interactions and delayed effects.
method Parameterizes controls using recurrent neural networks and trains them with modified fictitious play.
result Demonstrates effectiveness on finance problems with known solutions and new problems with derived Nash equilibria.

A game theory study examines gradual concessions in variable contribution games under uncertainty.

problem Gradualism in contribution games due to free rider effect.
method Stochastic game analysis of variable contribution games, extending Nerlove-Arrow model.
result Equilibrium characterized by regular control strategies leading to gradual concession.

This paper analyzes a hybrid reinsurance and investment game with bounded memory.

problem A hybrid stochastic differential reinsurance and investment game between reinsurer and insurers.
method Stochastic Stackelberg differential subgame and non-zero-sum stochastic differential subgame, using backward induction and dynamic programming.
result Derive equilibrium strategy and value functions explicitly, showing how delay and competition affect strategies.

Paper optimizes insurer's investment strategy in a fluctuating market with memory effects.

problem Optimizing insurer's investment in a market with regime switching and noisy memory.
method Formulated as a stochastic differential delay game, solved using BSDE approach.
result Derives analytical solutions for a specific case of a quadratic penalty function.

We propose a model of inter-bank lending and borrowing which takes into account clearing debt obligations. The evolution of log-monetary reserves of NN banks is described by coupled diffusions driven by controls with delay in their drifts. Banks are minimizing their finite-horizon objective functions which take into a…

2016-07-21abs ↗pdf ↗

Novel approach to Nash equilibrium in mean-field stochastic games with operator resolvents.

problem Finding Nash equilibrium in mean-field stochastic games with mean-field interaction.
method Proposed a novel approach to derive Nash equilibrium semi-explicitly using operator resolvents and stochastic Fredholm equations.
result Equilibrium of the NN-player game converges to mean-field equilibrium, and ε\varepsilon-Nash equilibrium derived as a by-product.

Paper tackles delays in multi-agent reinforcement learning, improving performance.

problem Challenges in reinforcement learning due to delays in real-world systems.
method Proposes a novel framework for multi-agent reinforcement learning with delays, using Delay-Aware Markov Games and centralized-decentralized training.
result Demonstrates significant improvement in performance with delay-aware multi-agent reinforcement learning.

We consider the problem of strongly-convex online optimization in presence of adversarial delays; in a T-iteration online game, the feedback of the player's query at time t is arbitrarily delayed by an adversary for d_t rounds and delivered before the game ends, at iteration t+d_t-1. Specifically for \algo{online-gradi…

2016-05-20abs ↗pdf ↗

We consider the static and dynamic models of Cournot duopoly with tax evasion. In the dynamic model we introduce the time delay and we analyze the local stability of the stationary state. There is a critical value of the delay when the Hopf bifurcation occurs.

2007-06-05abs ↗pdf ↗

Develops accelerated fixed-point methods with delayed oracles for scientific computing.

problem Approximating fixed points of nonexpansive operators.
method Combines Nesterov's acceleration and KM iteration with delayed inexact oracles.
result Establishes improved convergence rates for fixed-point approximation.

Gradient descent with delayed updates converges faster with noise, even when delays are significant.

problem Analyzing convergence of gradient descent with delayed gradients and stochastic noise.
method Novel technique using generating functions for convergence analysis.
result Convergence bounds show that stochastic noise mitigates the negative effects of delays, improving performance.

New algorithm tackles stochastic bandits with varying arm-dependent delays.

problem Applying existing algorithms to stochastic delayed bandit settings is restricted by strong assumptions on delay distributions.
method Proposes a simple UCB-based algorithm called PatientBandits that weakens assumptions on delay distributions.
result Provides bounds on regret and performance lower bounds for the PatientBandits algorithm.

Deep neural networks solve stochastic control problems with delay.

problem Challenges in stochastic control problems with delay due to path-dependence and high dimensions.
method Employing recurrent neural networks (RNNs) to parameterize policies and optimize objectives.
result RNNs, especially LSTMs, efficiently capture path-dependence and outperform feedforward networks in training and performance.

We propose RUDDER, a novel reinforcement learning approach for delayed rewards in finite Markov decision processes (MDPs). In MDPs the Q-values are equal to the expected immediate reward plus the expected future rewards. The latter are related to bias problems in temporal difference (TD) learning and to high variance p…

2018-06-20abs ↗pdf ↗

New algorithms for linear bandits with delayed feedback, achieving optimal regret bounds.

problem Delayed and partially observable feedback in stochastic linear bandits.
method Formalized as stochastic delayed linear bandit, proposed two algorithms tOTFLinUCB{ t OTFLinUCB} and tOTFLinTS{ t OTFLinTS}.
result Proved optimal ildeO(dT) ilde O(\smash{d\sqrt{T}}) bounds on the regret for tOTFLinUCB{ t OTFLinUCB}.

We study a variant of the stochastic KK-armed bandit problem, which we call "bandits with delayed, aggregated anonymous feedback". In this problem, when the player pulls an arm, a reward is generated, however it is not immediately observed. Instead, at the end of each round the player observes only the sum of a number…

2017-09-20abs ↗pdf ↗

Improved SGD rates with delayed and compressed gradients.

problem Convergence rates of SGD with delayed and compressed gradients.
method Analyzed SGD with delayed updates on smooth quasi-convex and non-convex functions, derived non-asymptotic rates.
result Convergence rates are affected by noise but not by delay, leading to optimal rates.

The paper solves optimal control problems for stochastic delay equations.

problem Optimal control of stochastic delay differential equations.
method Rewriting the problem in an infinite-dimensional Hilbert space, using dynamic programming and viscosity solutions.
result Characterizes the value function as the unique viscosity solution of the Hamilton-Jacobi-Bellman equation.

Improved algorithm for bandits with delayed feedback, combining adversarial and stochastic performance.

problem Adversarial and stochastic multiarmed bandits with delayed feedback.
method Modified Zimmert and Seldin's algorithm with near-optimal regret guarantees.
result Near-optimal regret guarantees in both adversarial and stochastic settings.

We analyze the convergence of gradient-based optimization algorithms that base their updates on delayed stochastic gradient information. The main application of our results is to the development of gradient-based distributed optimization algorithms where a master node performs parameter updates while worker nodes compu…

2011-04-28abs ↗pdf ↗

The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called "(decomposable) coarser transition kernels". This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and state-independe…

2013-11-07abs ↗pdf ↗

Delay-SDE-net models time series with memory and uncertainty, outperforming other models.

problem Accurately modeling time series with memory and uncertainty.
method Stochastic delay differential equations (SDDEs) neural network model with aleatoric and epistemic uncertainty.
result The Delay-SDE-net consistently outperforms other models in predicting time series values and uncertainties.

We study distributed stochastic convex optimization under the delayed gradient model where the server nodes perform parameter updates, while the worker nodes compute stochastic gradients. We discuss, analyze, and experiment with a setup motivated by the behavior of real-world distributed computation networks, where the…

2015-08-20abs ↗pdf ↗

Enhances SGLD for log-concave posteriors with asynchronous computation.

problem Sampling log-concave posterior distributions efficiently.
method Integrates asynchronous computation into SGLD with delayed gradients.
result Convergence in measure is not significantly affected by delayed gradient information.

Study proves convergence of interest rate model approximations.

problem Investigating convergence of stochastic interest rate models.
method Developed analytical tools for true and truncated EM solutions, proving convergence in probability.
result True solution converges in probability to truncated EM solution as step size approaches zero.

New algorithm reduces distributed optimization time with stochastic delays.

problem Optimizing distributed data with stochastic delays.
method Developed ADSAGA, a variant of SAGA for distributed-data settings with stochastic delays.
result ADSAGA converges in $ ilde{O}\left(\left(n + \sqrt{m}κ ight)\log(1/ε) ight)$ iterations under mean delay mm.

Paper develops Euler scheme for fractional delay diff. eqs with additive noise.

problem Developing a consistent Euler-Maruyama scheme for fractional stochastic delay diff. eqs.
method Euler-Maruyama scheme for fractional Brownian motion with additive noise.
result Achieved convergence rate of H+1/2 for smooth delays when H>1/2.

Optimal trading strategy between CEXs and DEXs with priority fees and stochastic delays.

problem Managing latency risk in trading between centralized and decentralized exchanges.
method Developed a mixed control framework combining absolutely continuous controls with impulse interventions, allowing for stochastic execution delays and multiple pending orders.
result Optimal priority fee selection significantly outperforms non-strategic fee selection.

This article is a sequel to [A.H.M.P]. In [A.H.M.P], we develop an explicit formula for pricing European options when the underlying stock price follows a non-linear stochastic delay equation with fixed delays in the drift and diffusion terms. In this article, we look at models of the stock price described by stochasti…

2006-04-28abs ↗pdf ↗

The paper models financial asset prices with jumps and evaluates European option prices using numerical methods.

problem Modeling and pricing European options with jumps in delayed stochastic systems.
method Existence, uniqueness, and positivity of solutions to delayed stochastic differential equations with jumps. Application of Fourier transformation for analytical pricing and Monte-Carlo simulation with a logarithmic Euler-Maruyama scheme for numerical approximation.
result The logarithmic Euler-Maruyama scheme provides a positive and convergent method for approximating the solution to the delayed stochastic differential equations with jumps.

Novel algorithm for decentralized optimization in time-varying networks with delays.

problem Decentralized optimization in networks with communication delays.
method DT-GO algorithm, applicable to general directed graphs, converges to same complexity as centralized SGD.
result Algorithm DT-GO achieves convergence rates for convex and non-convex objectives, similar to centralized SGD.

The paper analyzes a class of stochastic games involving moving free boundaries and Nash equilibria.

problem Analyzing interactions among players in stochastic games with moving free boundaries.
method Deriving sufficient conditions for Nash equilibrium through verification theorems, solving multi-dimensional free boundary problems, and Skorokhod problems.
result An intriguing connection between NE strategies and controlled rank-dependent stochastic differential equations.