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

Trend · papers per month

2965918871,182 · Jun 202019922001200920172026
48 results for general arrival dynamics

This paper tackles inventory control with general arrival dynamics and post-processing, improving profitability.

problem Inventory control with arbitrary arrival dynamics and post-processing constraints.
method Formulated as an exogenous decision process, incorporating deep generative models for arrivals, and applying supervised learning techniques.
result Improves profitability over production baselines and real-world A/B test data.

We examine the dynamics of the bid and ask queues of a limit order book and their relationship with the intensity of trade arrivals. In particular, we study the probability of price movements and trade arrivals as a function of the quote imbalance at the top of the limit order book. We propose a stochastic model in an …

2013-12-02abs ↗pdf ↗

We introduce a multivariate Hawkes process that accounts for the dynamics of market prices through the impact of market order arrivals at microstructural level. Our model is a point process mainly characterized by 4 kernels associated with respectively the trade arrival self-excitation, the price changes mean reversion…

2013-01-07abs ↗pdf ↗

Service system dynamics occur at the interplay between customer behaviour and a service provider's response. This kind of dynamics can effectively be modeled within the framework of queuing theory where customers' arrivals are described by point process models. However, these approaches are limited by parametric assump…

2019-06-24abs ↗pdf ↗

The paper optimizes portfolios in a market with hidden drift and random expert opinions.

problem Optimizing portfolios in a market with hidden Gaussian drift and random expert signals.
method Modeling the hidden drift using Kalman filters and solving the utility maximization problem with dynamic programming.
result Derivation of optimal portfolio weights and utility maximization under the given market conditions.

We studied non-dynamical stochastic resonance for the number of trades in the stock market. The trade arrival rate presents a deterministic pattern that can be modeled by a cosine function perturbed by noise. Due to the nonlinear relationship between the rate and the observed number of trades, the noise can either enha…

2008-07-06abs ↗pdf ↗

We propose and study a simple stochastic model for the dynamics of a limit order book, in which arrivals of market order, limit orders and order cancellations are described in terms of a Markovian queueing system. Through its analytical tractability, the model allows to obtain analytical expressions for various quantit…

2011-04-24abs ↗pdf ↗

Study off-policy evaluation and learning in dynamic pricing with context.

problem Dynamic personalized pricing and operations management problems with high-dimensional user types.
method Formalize causal structure, leverage single time-step evaluation, estimate marginal MDP.
result Improved out-of-sample policy performance in dynamic and capacitated pricing.

For a long investment time horizon, it is preferable to rebalance the portfolio weights at intermediate times. This necessitates a multi-period market model in which portfolio optimization is usually done through dynamic programming. However, this assumes a known distribution for the parameters of the financial time se…

2019-11-18abs ↗pdf ↗

This paper extends subordinated models to include stochastic time changes, improving financial modeling.

problem Improving financial models to better capture market features like jump clustering and volatility persistence.
method Subordinated processes with Levy and stochastic arrival mechanisms.
result Strong consistency and asymptotic normality results for VG and VGSA processes under various stochastic arrival models.

Model predicts stock returns from order arrivals and cancellations.

problem Forecasting intraday stock returns using limit order book dynamics.
method Microscopic model based on operator algebra for order arrivals and cancellations, estimating arrival and cancellation rate distributions.
result The model explains 80% of returns in in-sample forecasts and 15% in out-of-sample forecasts.

We propose a simple stochastic model for the dynamics of a limit order book, extending the recent work of Cont and de Larrard (2013), where the price dynamics are endogenous, resulting from market transactions. We also show that the conditional diffusion limit of the price process is the so-called Brownian meander.

2017-04-21abs ↗pdf ↗

New learning methods for open systems with variable agents.

problem Learning in open systems with dynamic agent arrivals and departures.
method Formulated a unified open-system bandit problem with general dynamics, introducing new concepts like pre-training degree and stability.
result Certified global-UCB learning methodologies with provable guarantees, revealing dependencies between entry uncertainty, stability, and agent patterns.

We introduce a prototype model in an attempt to capture some aspects of market dynamics simulating a trading mechanism. The model description starts with a discrete-space, continuous-time Markov process describing arrival and movement of orders with different prices. We then perform a re-scaling procedure leading to a …

2012-01-22abs ↗pdf ↗

DaringFed incentivizes clients in OFL with dynamic rewards under TII.

problem Designing incentives for OFL clients under dynamic, incomplete information.
method Formulated as a dynamic signaling and pricing allocation problem in a Bayesian persuasion game.
result Optimal design of DaringFed improves accuracy and convergence speed by 16.99%.

Dynamic assortment problem on two-sided platform with unknown parameters

problem Optimizing assortment display in an online platform with incomplete information and heterogeneous customers
method Data-driven algorithm that learns choice parameters while optimizing revenue
result Worst-case regret grows polylogarithmically over time

Many recommendation algorithms rely on user data to generate recommendations. However, these recommendations also affect the data obtained from future users. This work aims to understand the effects of this dynamic interaction. We propose a simple model where users with heterogeneous preferences arrive over time. Based…

2017-03-01abs ↗pdf ↗

In this paper we derive a scaling limit for an infinite dimensional limit order book model driven by Hawkes random measures. The dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator. With our choice of scaling the dynamics converges to a coupled SDE-ODE s…

2017-09-05abs ↗pdf ↗

Online algorithm detects community structure in dynamic event streams.

problem Community detection in networks with temporal event streams.
method Continuous-time point process latent network models with fast online variational inference.
result Online inference achieves comparable community recovery to non-online methods but with computational gains.

Modeling market dynamics with informed and uninformed traders and fads.

problem Optimizing market making in a market with fads, informed, and uninformed traders.
method Characterizing the optimal liquidity provision problem in a market with fads, informed, and uninformed traders, considering both complete and partial information.
result The price of liquidity is a function of the proportion of informed traders, and strategies ignoring fads underperform.

ARC algorithm optimizes dynamic pricing with correlated observations.

problem Optimizing dynamic pricing with correlated and generally distributed observations.
method Extends ARC algorithm to batched bandits with generalised linear model.
result ARC algorithm outperforms alternative approaches in dynamic pricing.

New algorithm learns Koopman operator online, with complexity control and convergence guarantees.

problem Online learning of Koopman operator for general nonlinear systems.
method Sparse online learning via stochastic approximation, RKHS action, CME operator.
result Provably convergent algorithm with finite-time guarantees in mis-specified setting.

This paper derives a diffusion approximation for a sequence of discrete-time one-sided limit order book models with non-linear state dependent order arrival and cancellation dynamics. The discrete time sequences are specified in terms of an R+\R_+-valued best bid price process and an Lloc2L^2_{loc}-valued volume process. …

2016-08-05abs ↗pdf ↗

Establishes a microstructural foundation for a rough log-normal volatility model.

problem Developing a robust model for financial volatility under microstructural effects.
method Introduced a sequence of order-driven financial market models with Poisson process arrivals and analyzed their convergence to a log-normal rough volatility model.
result Weak convergence of price-volatility process to a log-normal rough volatility model with established weak error rates.

Proposes a new simulator for complex arrival processes.

problem Modeling and simulating complex arrival processes with non-stationary and multi-dimensional rates.
method Integrates Monte Carlo and GANs to model a broad class of arrival processes.
result Consistent and efficient estimation of the simulator using Wasserstein distance.

R. Cont and A. de Larrard (SIAM J. Finan. Math, 2013) introduced a tractable stochastic model for the dynamics of a limit order book, computing various quantities of interest such as the probability of a price increase or the diffusion limit of the price process. As suggested by empirical observations, we extend their …

2016-01-07abs ↗pdf ↗

Digital tools may hinder or facilitate multidisciplinary collaboration in occupational health.

problem Challenges in multidisciplinary collaboration in occupational health.
method Study of a precursor SPSTI's digital tools and their impacts.
result Digital tools can act as both brakes and levers for multidisciplinary dynamics.

Study on queues with Hawkes arrivals, proving steady-state behavior and developing an efficient algorithm.

problem Analyzing the steady-state behavior of queues with Hawkes arrivals.
method Novel coupling techniques and exponential convergence results for workload and busy period processes.
result Exponential convergence of queueing processes to their stationary distribution.

Study improves queue length estimation from connected vehicles by filtering parameters.

problem Large errors in estimated queue lengths at low market penetration rates.
method Used Kalman and Particle filters as multilevel real-time estimators.
result Filters reduce estimation errors and improve accuracy within 15 minutes.