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

316192122 · Jun 202019922001200920172026
48 results for Markovian Agents

Study designs incentives for adapting multi-agent systems without knowing their learning dynamics.

problem Designing incentives for an adapting population in multi-agent systems without prior knowledge of their learning dynamics.
method Introduces a model-based non-episodic Reinforcement Learning (RL) formulation for steering Markovian agents towards desired policies, focusing on history-dependent strategies to handle model uncertainty.
result Identifies conditions for the existence of steering strategies to guide agents to desired policies and provides empirical algorithms to approximately solve the objective.

Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.

problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.

Describes state variables in sequential decision problems, linking them to Markovian and non-Markovian models.

problem Sequential decision problems, especially in active learning and POMDPs, where decisions affect what is observed and learned.
method Canonical framework and novel two-agent perspective of POMDPs, defining state variables to claim Markovian or non-Markovian models.
result Properly modeled sequential decision problems are Markovian, while real decision problems are often non-Markovian.

A new metric detects non-Markovian states in partially observable environments.

problem Learning state representations in partially observable environments.
method Introducing the λλ-discrepancy metric to detect non-Markovian states.
result The λλ-discrepancy is zero for Markov processes and non-zero for partially observable environments.

ARL bridges non-Markovian decision processes with reinforcement learning, improving foresight and stability.

problem Inaccurate foresight in non-Markovian environments due to state-based methods' limitations.
method Lifted state space into a signature-augmented manifold, using a self-consistent field approach to anticipate future path-law.
result ARL achieves deterministic evaluation of expected returns with reduced computational complexity and variance.

In a Markovian stochastic volatility model, we consider financial agents whose investment criteria are modelled by forward exponential performance processes. The problem of contingent claim indifference valuation is first addressed and a number of properties are proved and discussed. Special attention is given to the c…

2011-09-18abs ↗pdf ↗

FedSARSA converges with heterogeneous agents, achieving linear speed-up.

problem Convergence analysis of Federated SARSA with heterogeneous agents.
method Linear function approximation, local training, multi-step error expansion.
result FedSARSA achieves linear speed-up with respect to the number of agents.

We prove the global existence of an incomplete, continuous-time finite-agent Radner equilibrium in which exponential agents optimize their expected utility over both running consumption and terminal wealth. The market consists of a traded annuity, and, along with unspanned income, the market is incomplete. Set in a Bro…

2018-09-16abs ↗pdf ↗

Paper analyzes convergence of decentralized algorithms with noise and bias.

problem Finite time convergence analysis of decentralized stochastic approximation schemes.
method Separated iterates into consensual parts and consensus error; bounded consensus error in terms of stationarity.
result Decentralized SA scheme converges at O(logT/T){\cal O}(\log T/ \sqrt{T} ) rate.

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.

UD-SGD analysis shows efficient sampling by a few agents can outperform others.

problem Analyzing convergence speed and sampling strategies in UD-SGD.
method Asymptotic analysis of UD-SGD with various communication patterns and sampling strategies.
result Efficient sampling by a few agents can lead to better overall convergence.

PFedRL-Rep learns shared and personalized policies for heterogeneous environments.

problem Poor performance of single policy in heterogeneous environments.
method Develops PFedRL-Rep framework with shared feature representation and personalized weights.
result Proves linear convergence speedup with respect to the number of agents.

Non-Markovian point process shows power-law scaling, similar to nonlinear Markovian process.

problem Understanding the scaling behavior of non-Markovian point processes.
method Analyzed a confined fractional Brownian motion-driven point process and compared it to a nonlinear Markovian process.
result A nonlinear Markovian process can reproduce the power-law scaling behavior of a non-Markovian point process.

Develops variational framework for LQG risk-sensitive MFGs with major-minor interactions.

problem Risk-sensitive optimal control in LQG systems with major-minor interactions.
method Variational approach, nonlinear necessary and sufficient condition of optimality, equivalent risk-neutral measure, Markovian closed-loop best-response strategies.
result Derives optimal control strategies for LQG risk-sensitive MFGs with major-minor interactions, establishing Nash and ε\varepsilon-Nash equilibria.

Projects Markovian processes from Itô semimartingales with jumps.

problem Modeling Itô semimartingales with jumps using Markovian projections.
method Construct Markovian projections for Itô semimartingales with jumps using non-local FPKEs.
result Markovian projections match the marginal laws of the original process.

Study on price formation in financial markets with a single default event.

problem Equilibrium price formation in financial markets with a single default risk.
method Characterized optimal strategies using quadratic-growth BSDEs, derived market-clearing condition, and established mean-field BSDE solvability.
result Characterized equilibrium risk premium and its dependence on default risk factors.

In this paper we investigate the local risk-minimization approach for a semimartingale financial market where there are restrictions on the available information to agents who can observe at least the asset prices. We characterize the optimal strategy in terms of suitable decompositions of a given contingent claim, wit…

2013-12-16abs ↗pdf ↗

This paper solves the inversion problem for jump processes using Markovian projections.

problem Calibrating jump-diffusion models with both local and stochastic features.
method Inverting Markovian projections for pure jump processes.
result Constructs calibrated local stochastic intensity (LSI) models for credit risk applications.

In this paper, we present a family of a control-stopping games which arise naturally in equilibrium-based models of market microstructure, as well as in other models with strategic buyers and sellers. A distinctive feature of this family of games is the fact that the agents do not have any exogenously given fundamental…

2017-08-01abs ↗pdf ↗

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.

Paper proposes MAMRL for efficient energy dispatch in self-powered edge computing systems.

problem High energy consumption in self-powered edge computing systems.
method Developed a semi-distributed data-driven MAMRL framework to solve a two-stage linear stochastic programming problem.
result The proposed MAMRL framework reduces up to 11% non-renewable energy usage and 22.4% energy cost.

Breaks down complex nonlinear dynamics into simpler components.

problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.

Paper establishes convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.

problem Analyzing convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.
method Novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing length.
result First almost sure convergence rate and maximal concentration bound with exponential tails for contractive stochastic approximation algorithms with Markovian noise.

Unified analytical tool for non-Markovian jump processes.

problem Analyzing history-dependent jump processes with non-Markovian behavior.
method Developed a standard form of master equations using Laplace-space embedding and asymptotic solution.
result Unified analytical toolset for general non-Markovian processes, leading to the GLE approximation.

Study improves covariance estimation for SGD under Markovian data, matching best rates.

problem Improving covariance estimation for SGD in Markovian data settings.
method Online overlapping batch-means covariance estimator for SGD under Markovian sampling.
result Established convergence rates for covariance estimation under Markovian sampling.

We develop a Markovian approximation for SVV models to compute hedging strategies.

problem Computing optimal hedging strategies for SVV models with non-Markovian noise.
method Develop a Markovian approximation of the Volterra noise kernel to compute hedging strategies.
result Error estimates for the approximation of volatility, prices, and optimal hedge.

A new HOM model improves forecasting of Indian base metal prices.

problem Improving accuracy in predicting base metal prices in the Indian market.
method A Higher Order Markovian (HOM) model with varying order based on market delay.
result The HOM model consistently outperforms the standard Markovian model in forecasting.

We prove existence and uniqueness of stochastic equilibria in a class of incomplete continuous-time financial environments where the market participants are exponential utility maximizers with heterogeneous risk-aversion coefficients and general Markovian random endowments. The incompleteness featured in our setting - …

2009-06-01abs ↗pdf ↗

Investigates optimal consumption and investment strategies in non-Markovian markets with unbounded parameters.

problem Optimal consumption and investment strategies in non-Markovian markets with unbounded parameters.
method Martingale optimal principle and quadratic BSDEs with exponential moment.
result Establishes optimal strategies for consumption and investment.

We simplify a complex volatility model to make it easier to price options.

problem The rough Bergomi model's non-Markovian nature complicates option pricing.
method We approximate the rBergomi model with a Bergomi model that is Markovian.
result The rBergomi model can be effectively approximated by a Markovian model.