false

Optimal Control of Reserve Asset Portfolios for Pegged Digital Currencies

Optimal Control of Reserve Asset Portfolios for Pegged Digital Currencies ArXiv ID: 2508.09429 “View on arXiv” Authors: Alexander Hammerl, Georg Beyschlag Abstract Stablecoins promise par convertibility, yet issuers must balance immediate liquidity against yield on reserves to keep the peg credible. We study this treasury problem as a continuous-time control task with two instruments: reallocating reserves between cash and short-duration government bills, and setting a spread fee for either minting or burning the coin. Mint and redemption flows follow mutually exciting processes that reproduce clustered order flow; peg deviations arise when redemptions exceed liquid reserves within settlement windows. We develop a stochastic model predictive control framework that incorporates moment closure for event intensities. Using Pontryagin’s Maximum Principle, we demonstrate that the optimal control exhibits a bang-off-bang structure: each asset type is purchased at maximum capacity when the utility difference exceeds the corresponding difference in shadow costs. Introducing settlement windows leads to a sampled-data implementation with a simple threshold (soft-thresholding) structure for rebalancing. We also establish a monotone stress-response property: as expected outflows intensify or windows lengthen, the optimal policy shifts predictably toward cash. In simulations covering various stress test scenarios, the controller preserves most bill carry in calm markets, builds cash quickly when stress emerges, and avoids unnecessary rotations under transitory signals. The proposed policy is implementation-ready and aligns naturally with operational cut-offs. Our results translate empirical flow risk into auditable treasury rules that improve peg quality without sacrificing avoidable carry. ...

August 13, 2025 · 2 min · Research Team

Breaking the Dimensional Barrier for Constrained Dynamic Portfolio Choice

Breaking the Dimensional Barrier for Constrained Dynamic Portfolio Choice ArXiv ID: 2501.12600 “View on arXiv” Authors: Unknown Abstract We propose a scalable, policy-centric framework for continuous-time multi-asset portfolio-consumption optimization under inequality constraints. Our method integrates neural policies with Pontryagin’s Maximum Principle (PMP) and enforces feasibility by maximizing a log-barrier-regularized Hamiltonian at each time-state pair, thereby satisfying KKT conditions without value-function grids. Theoretically, we show that the barrier-regularized Hamiltonian yields O($ε$) policy error and a linear Hamiltonian gap (quadratic when the KKT solution is interior), and we extend the BPTT-PMP correspondence to constrained settings with stable costate convergence. Empirically, PG-DPO and its projected variant (P-PGDPO) recover KKT-optimal policies in canonical short-sale and consumption-cap problems while maintaining strict feasibility across dimensions; unlike PDE/BSDE solvers, runtime scales linearly with the number of assets and remains practical at n=100. These results provide a rigorous and scalable foundation for high-dimensional constrained continuous-time portfolio optimization. ...

January 22, 2025 · 2 min · Research Team