Optimal Prophet Inequalities for Gain from Trade

@misc{chen2026optimal,
  title = {{Optimal Prophet Inequalities for Gain from Trade}},
  author = {Xujin Chen and Xiaodong Hu and Changjun Wang and Qingjie Ye},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.30742},
  eprint = {2609.30742},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.30742},
}

TY  - UNPB
TI  - Optimal Prophet Inequalities for Gain from Trade
AU  - Xujin Chen
AU  - Xiaodong Hu
AU  - Changjun Wang
AU  - Qingjie Ye
PY  - 2026
DA  - 2026/09/25
PB  - arXiv
DO  - 10.48550/arxiv.2609.30742
UR  - https://arxiv.org/abs/2609.30742
AB  - We initiate the study of prophet trading, an online trading model in which a trader interacts with sellers and buyers who arrive in a uniformly random order and whose prices are drawn independently from a common known distribution. The trader aims to maximize the expected gain from trade (GFT), with performance measured against an omniscient prophet that knows the realized arrival order and all prices in advance. Unlike the classical prophet inequality problem, the trader must make both purchasing and selling decisions while managing the inventory, which makes both the prophet benchmark and the analysis of online algorithms substantially more intricate. For arbitrary numbers of buyers and sellers, we propose a simple threshold-based algorithm and prove a distribution-free competitive ratio of~2, which is the best possible. Our main technical contribution is an exact characterization of the inventory process induced by threshold trading. By expressing the algorithm's expected GFT in terms of the cumulative holding probability at buyer arrivals, we derive an exact formula for this inventory term, which serves as the foundation of our analysis and yields sharper guarantees in several important special cases. For balanced trading (with n sellers and n buyers), we improve the competitive ratio to (2n^2−n)/((n+4^−n−1)(n+1)), which is strictly less than 2 for every n>1. For the single-seller case, we sharpen the analysis of the fixed-threshold algorithm to obtain an asymptotic competitive ratio of 2e^2/(e^2+1)≈1.76. Furthermore, by exploiting the additional structure of this setting, we design an adaptive-threshold algorithm whose competitive ratio approaches e/(e−1)≈ 1.58. Due to a symmetry property of our general algorithmic idea, the same $1.76$-competitive guarantee also holds for the single-buyer case.
ER  -