Haoran Xu

PhD Candidate
Management Science and Engineering · Stanford University

I am a PhD candidate in Management Science and Engineering at Stanford University. My research studies sequential decision making under uncertainty, with a focus on both theoretical rigor and practical impact. In my theoretical research, I am interested in results that provide managerial insights and practical guidance for a broad class of operational decision-making problems. My current theoretical research focuses on online resource allocation and multistage stochastic programming. A main theme of my research is developing algorithms and providing analyses for problems motivated by real-world applications in these areas. Alongside theoretical research, I think solving real-world operational problems is of equal importance. Designing and implementing control methods to enhance the sustainability of complex systems, such as AI data centers, is another main theme of my research.

Selected Research

All research

Job Market Paper

Online Linear Programming with Batching

Haoran Xu, Peter W. Glynn, and Yinyu Ye

Submitted to Management Science · arXiv preprint, 2024

In the batching operation, the key driver of the regret of online LP is the number of batches. We show that the regret of online LP with batching is logarithmic in the number of batches and independent of the number of orders.

Abstract for Online Linear Programming with Batching

We study Online Linear Programming (OLP) with batching. The planning horizon is cut into K batches, and decisions on orders can be delayed to the end of their associated batch. The ability to delay decisions improves operational performance, as measured by regret. We study two questions: (1) What is a lower bound on the regret as a function of K and the length of the planning horizon? (2) Which algorithms can achieve this regret lower bound? This paper analyzes these questions when the distribution of the reward has a continuous support. We provide an Ω(log⁡K) regret lower bound in the single-resource case, and we provide pricing algorithms having an O(log⁡K) regret in the setting with Poisson arrivals and multiple types of resources. All the algorithms update the prices at most K times and only delay orders of the first and the last batches. All the regret bounds are independent of the length of the planning horizon. Finally, we study a more realistic large support setting where the number of distinct order types is finite but scales with the total number of orders. We prove that our Θ(log⁡K) bounds still hold for the batching operation of a multisecretary problem with discretized uniform rewards in this large support setting, provided the support grows fast enough. This suggests that the continuous support setting that is the paper’s focus serves as a useful theoretical surrogate for the more realistic large finite support setting.

Bridging the Discrete and Continuous Reward Theories for Online Linear Programming: The Key Role Played by the Support Size

Haoran Xu, Peter W. Glynn, and Yinyu Ye

Working paper · SSRN preprint, 2026

We bridge the discrete and continuous reward theories for online LP by studying the joint dependence of regret on the number of requests n and the reward support size S. When there is a single type of resource, we show that the regret of online LP is O(log⁡(min⁡{n,S2})) under appropriate regularity conditions.

Abstract for Bridging the Discrete and Continuous Reward Theories for Online Linear Programming: The Key Role Played by the Support Size

Existing finite support theory for online linear programming gives regret bounds independent of the number of requests but typically polynomial in the reward support size. On the other hand, continuous support theory establishes that the regret is logarithmic in the number of requests. Given the quite different regret behaviors in these two settings, it is natural to study the intermediate regime, where both the number of requests n and the reward-support size S are large but finite. This regime is also important at a practical level, as it describes settings in which the number of customer types and number of requests are both large. We consider the single resource problem with independent and identically distributed requests from a known distribution. Under appropriate regularity conditions, we prove an O(log⁡(min⁡{n,S2})+1/πmin) regret bound for the Fluid Bayes Selector algorithm, where πmin denotes the smallest point mass in the marginal distribution of resource consumption. This bound requires no nondegeneracy assumption on the finite support fluid LP. Under additional conditions, every feasible policy incurs Ω(log⁡(min⁡{n,S2})) regret. We construct two sequences of instances to show that the 1/πmin term is necessary in the worst case but not for every instance. For the multisecretary problem, exact asymptotics under additional smoothness and polynomial support growth establish n as the exact support size scale at which continuous support theory correctly predicts the leading order term of regret of the large support regime. These results quantify the transition between finite and continuous support regret behavior, and clarify the impact of support size on regret.