Searcharxiv⌕ Search

arXiv subjects

Lukas-Benedikt Fiechtner

Publications and source records attributed to Lukas-Benedikt Fiechtner.

3 recordsLinked to original sources

Distributionally Robust Regret Optimal LQR with Common Stage-Law Ambiguity

We study what is, to our knowledge, the first tractable multistage ex-ante distributionally robust regret optimization (DRRO) formulation for stochastic control. We consider finite-horizon LQR with common stage-law ambiguity, where disturbances are independent across time but drawn from the same unknown stage law whose mean and covariance lie in a Gelbrich ball around nominal moments. Unlike the benign single-stage quadratic setting, the nominal controller is generally not regret-optimal: reuse of the stage law makes past disturbances informative for future decisions. Despite the general hardness of DRRO, we show that, over affine disturbance-feedback policies, the multistage DRRO-LQR problem admits an exact semidefinite programming reformulation. An optimal controller in this class is the nominal LQR controller plus a strictly causal empirical-mean correction. We also characterize worst-case moment pairs and show that, for the DRRO-optimal policy, they are not unique. Portfolio liquidation experiments show that DRRO substantially reduces worst-case regret relative to DRO and the nominal controller, with comparatively modest increases in worst-case cost, and exhibits a learning effect: its correction matrices empirically approach the corresponding coefficients of the oracle controller that knows the true disturbance law in hindsight.

math.OC↗

Strategic Index Reconstitution: Differential Games, Closed-Loop Equilibria and Mean-Field Dynamics

We study strategic trading around index reconstitution in a continuous-time, multiasset game with transient cross-asset price impact and heterogeneous beliefs about future index membership. Opportunistic traders position before a public announcement, adjust to the revealed composition, and trade around an indexer following a prescribed execution schedule. Under a no-price-manipulation condition, we construct a subgame-perfect Nash equilibrium on every finite horizon. The affine feedback policies are computed from a non-standard matrix Riccati equation and linear ordinary differential equations whose number and dimensions do not grow with the number of traders. Aggregate inventories and price impact depend on beliefs only through the population-average belief, while differences in beliefs affect individual inventory positions. Under mean-field scaling, we construct a mean-field equilibrium and obtain quantitative convergence and approximate-Nash bounds. Numerical illustrations show how competition and impact decay determine the balance between adverse price displacement from anticipatory trading and savings in the indexer's execution costs when opportunists trade against its orders during implementation.

math.OC↗

Wasserstein Distributionally Robust Regret Optimization

Distributionally robust optimization (DRO) is widely used for decision-making under uncertainty, but its adversarial focus on worst-case loss can lead to overly conservative policies. To mitigate this, we study ex-ante Distributionally Robust Regret Optimization (DRRO) with Wasserstein ambiguity sets, designed to balance robustness with upside potential. We develop a theory of Wasserstein DRRO (WDRRO) paralleling Wasserstein DRO. Under smoothness and regularity, WDRRO selects among ERM optima by a first-order gradient-discrepancy rule. If the ERM optimizer is unique, first-order sensitivity vanishes and a second-order expansion governs deviations. For convex quadratics ERM and DRRO coincide for any radius. We then study regimes where these assumptions fail: nondifferentiable max-affine losses, discrete references, and larger radii, where WDRRO can differ from ERM and WDRO. We show that computing WDRRO regret is NP-hard even without bilinear terms. Nevertheless, we develop exact algorithms, a tractable convex relaxation with guarantees, and experiments showing tightness and loss-dependent behavior.

math.OC↗