false

On the utility problem in a market where price impact is transient

On the utility problem in a market where price impact is transient ArXiv ID: 2511.12093 “View on arXiv” Authors: Lóránt Nagy, Miklós Rásonyi Abstract We consider a discrete-time model of a financial market where a risky asset is bought and sold with transactions having a transient price impact. It is shown that the corresponding utility maximization problem admits a solution. We manage to remove some unnatural restrictions on the market depth and resilience processes that were present in earlier work. A non-standard feature of the problem is that the set of attainable portfolio values may fail the convexity property. ...

November 15, 2025 · 2 min · Research Team

Randomization in Optimal Execution Games

Randomization in Optimal Execution Games ArXiv ID: 2503.08833 “View on arXiv” Authors: Unknown Abstract We study optimal execution in markets with transient price impact in a competitive setting with $N$ traders. Motivated by prior negative results on the existence of pure Nash equilibria, we consider randomized strategies for the traders and whether allowing such strategies can restore the existence of equilibria. We show that given a randomized strategy, there is a non-randomized strategy with strictly lower expected execution cost, and moreover this de-randomization can be achieved by a simple averaging procedure. As a consequence, Nash equilibria cannot contain randomized strategies, and non-existence of pure equilibria implies non-existence of randomized equilibria. Separately, we also establish uniqueness of equilibria. Both results hold in a general transaction cost model given by a strictly positive definite impact decay kernel and a convex trading cost. ...

March 11, 2025 · 2 min · Research Team

Fredholm Approach to Nonlinear Propagator Models

Fredholm Approach to Nonlinear Propagator Models ArXiv ID: 2503.04323 “View on arXiv” Authors: Unknown Abstract We formulate and solve an optimal trading problem with alpha signals, where transactions induce a nonlinear transient price impact described by a general propagator model, including power-law decay. Using a variational approach, we demonstrate that the optimal trading strategy satisfies a nonlinear stochastic Fredholm equation with both forward and backward coefficients. We prove the existence and uniqueness of the solution under a monotonicity condition reflecting the nonlinearity of the price impact. Moreover, we derive an existence result for the optimal strategy beyond this condition when the underlying probability space is countable. In addition, we introduce a novel iterative scheme and establish its convergence to the optimal trading strategy. Finally, we provide a numerical implementation of the scheme that illustrates its convergence, stability, and the effects of concavity on optimal execution strategies under exponential and power-law decay. ...

March 6, 2025 · 2 min · Research Team

In-Context Operator Learning for Linear Propagator Models

In-Context Operator Learning for Linear Propagator Models ArXiv ID: 2501.15106 “View on arXiv” Authors: Unknown Abstract We study operator learning in the context of linear propagator models for optimal order execution problems with transient price impact à la Bouchaud et al. (2004) and Gatheral (2010). Transient price impact persists and decays over time according to some propagator kernel. Specifically, we propose to use In-Context Operator Networks (ICON), a novel transformer-based neural network architecture introduced by Yang et al. (2023), which facilitates data-driven learning of operators by merging offline pre-training with an online few-shot prompting inference. First, we train ICON to learn the operator from various propagator models that maps the trading rate to the induced transient price impact. The inference step is then based on in-context prediction, where ICON is presented only with a few examples. We illustrate that ICON is capable of accurately inferring the underlying price impact model from the data prompts, even with propagator kernels not seen in the training data. In a second step, we employ the pre-trained ICON model provided with context as a surrogate operator in solving an optimal order execution problem via a neural network control policy, and demonstrate that the exact optimal execution strategies from Abi Jaber and Neuman (2022) for the models generating the context are correctly retrieved. Our introduced methodology is very general, offering a new approach to solving optimal stochastic control problems with unknown state dynamics, inferred data-efficiently from a limited number of examples by leveraging the few-shot and transfer learning capabilities of transformer networks. ...

January 25, 2025 · 2 min · Research Team

Optimal Execution among $N$ Traders with Transient Price Impact

Optimal Execution among $N$ Traders with Transient Price Impact ArXiv ID: 2501.09638 “View on arXiv” Authors: Unknown Abstract We study $N$-player optimal execution games in an Obizhaeva–Wang model of transient price impact. When the game is regularized by an instantaneous cost on the trading rate, a unique equilibrium exists and we derive its closed form. Whereas without regularization, there is no equilibrium. We prove that existence is restored if (and only if) a very particular, time-dependent cost on block trades is added to the model. In that case, the equilibrium is particularly tractable. We show that this equilibrium is the limit of the regularized equilibria as the instantaneous cost parameter $\varepsilon$ tends to zero. Moreover, we explain the seemingly ad-hoc block cost as the limit of the equilibrium instantaneous costs. Notably, in contrast to the single-player problem, the optimal instantaneous costs do not vanish in the limit $\varepsilon\to0$. We use this tractable equilibrium to study the cost of liquidating in the presence of predators and the cost of anarchy. Our results also give a new interpretation to the erratic behaviors previously observed in discrete-time trading games with transient price impact. ...

January 16, 2025 · 2 min · Research Team