Trading with the STARS: Algorithm Design & Spectrum of Fundamental Limits for Trading with Storage
Abstract
We study an online trading problem where a trader, given a sequence of i.i.d. prices drawn from a known distribution F on [0,1], must make irrevocable buy, sell, or hold decisions subject to storage constraints. We investigate achievable algorithmic performance measured in terms of regret, the difference between the expected profit of the hindsight optimal policy that knows the entire price sequence and an online algorithm. We analyze finite atomic and continuous distributions characterized by their local behavior around the median which we capture using a parameter β. The parameter β quantifies how the mass of prices accumulates around the distribution median. We identify a new driver of algorithmic performance, demonstrating that median gaps coupled with an initial inventory level of zero can force regret scaling of Ω(T(β+ 1)/(2β+4)) --- establishing a novel spectrum of fundamental limits on algorithmic performance. We then study STARS, short for Storage Trading by Averaging Repeatedly across multiple Scenarios, which simulates possible future price scenarios to approximate the value-to-go function and make buy/sell/hold decisions. We show that STARS obtain near-optimal algorithmic performance (upto poly-logarithmic factors) across a broad range of distributions. In particular, it achieves O(log T) regret for finite atomic prices, Õ(Tβ/(2β+2)) for continuous distributions without a median gap and Õ(T(β+1)/(2β+4)) for continuous distributions with a median gap for β≥ 0.
Related
- Thin Trading and the Singularity Spectrum: Evidence from Tokenized Carbon Markets
- Stock Exchange Trading Optimization Algorithm Improved Based on Information Technology Investment Analysis for Numerical Optimization and Practical Problems
- Optimality of Threshold Policies for Heat Storage Optimization and a Policy Gradient Algorithm
- Finite-Memory Control of POMDPs: Fundamental Limits and Efficient Design
- Customizing Wireless Channels via Intelligent Reflecting Surfaces: Feasibility, Fundamental Limits, and Constructive Design
BibTeX
@misc{anunrojwong2026trading,
title = {{Trading with the STARS: Algorithm Design & Spectrum of Fundamental Limits for Trading with Storage}},
author = {Jerry Anunrojwong and Akshit Kumar and Rachitesh Kumar},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.07285},
eprint = {2610.07285},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.07285},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Trading with the STARS: Algorithm Design & Spectrum of Fundamental Limits for Trading with Storage
AU - Jerry Anunrojwong
AU - Akshit Kumar
AU - Rachitesh Kumar
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.07285
UR - https://arxiv.org/abs/2610.07285
AB - We study an online trading problem where a trader, given a sequence of i.i.d. prices drawn from a known distribution F on [0,1], must make irrevocable buy, sell, or hold decisions subject to storage constraints. We investigate achievable algorithmic performance measured in terms of regret, the difference between the expected profit of the hindsight optimal policy that knows the entire price sequence and an online algorithm. We analyze finite atomic and continuous distributions characterized by their local behavior around the median which we capture using a parameter β. The parameter β quantifies how the mass of prices accumulates around the distribution median. We identify a new driver of algorithmic performance, demonstrating that median gaps coupled with an initial inventory level of zero can force regret scaling of Ω(T^(β+ 1)/(2β+4)) --- establishing a novel spectrum of fundamental limits on algorithmic performance. We then study STARS, short for Storage Trading by Averaging Repeatedly across multiple Scenarios, which simulates possible future price scenarios to approximate the value-to-go function and make buy/sell/hold decisions. We show that STARS obtain near-optimal algorithmic performance (upto poly-logarithmic factors) across a broad range of distributions. In particular, it achieves O(log T) regret for finite atomic prices, Õ(T^β/(2β+2)) for continuous distributions without a median gap and Õ(T^(β+1)/(2β+4)) for continuous distributions with a median gap for β≥ 0.
ER -