Sentao Miao

Sentao Miao

Auto-generated profile, based on publicly available information

Sentao Miao

Leeds School of Business, University of Colorado Boulder, Boulder, Colorado 80309

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2023 in Operations Research
Verified
Journal Article
Closed access
XCXi Chen
Xi Chen
SMSentao Miao
Sentao Miao
YWYining Wang
Yining Wang
With the rapid development of artificial intelligence and big data, the application of data-driven personalized pricing has been increasingly prevalent in real practices such as finance, insurance, and retailing. However, with the public’s growing concern of the abuse of their personal data, legislation efforts are being taken to guarantee data privacy. In this work, we guarantee customers’ data privacy from the algorithm design of our dynamic personalized pricing policies. Two algorithms are developed with different levels of privacy guarantee. The first algorithm protects customers’ data in a centralized manner, meaning that the data aggregator (the pricing platform) is trusted, and the attacker is unlikely to know customers’ personal information. The second algorithm has a stronger privacy guarantee, which is mathematically proved to be able to protect customers’ data even when the data set is hacked. Besides privacy protection, both of our algorithms are effective in achieving near-optimal revenue maximization.

1 January 2022 in Operations Research
Verified
Journal Article
Closed access
SMSentao Miao
Sentao Miao
SJStefanus Jasin
Stefanus Jasin
XCXiuli Chao
Xiuli Chao
Simple Algorithms for Complex Multiwarehouse, Multistore Inventory Control Problems Retailers (both brick-and-mortar and e-commerce) have always faced the problem of allocating inventories in their warehouses (or central distribution centers) to the stores (or smaller local warehouses) in order to minimize total costs. The problem is particularly challenging when the network structure is large and complex, the selling season is long, and the replenishment is frequent. For example, giant retail chains such as Macy’s typically have many warehouses and hundreds of stores across the United States, and online retailers such as Amazon have many distribution centers and over one hundred fulfillment centers. The authors develop algorithms to solve this multiwarehouse, multistore (MWMS) inventory control problem. Their algorithms are computationally efficient and asymptotically optimal as the problem becomes large and complex. This feature is very appealing to today’s fast-moving retail industry with rapidly expanding business scale.

1 November 2025 in Operations Research
Verified
Journal Article
Closed access
MCMaxime C. Cohen
Maxime C. Cohen
SMSentao Miao
Sentao Miao
YWYining Wang
Yining Wang
Personalized prices can boost revenue, but they increasingly draw fire for hidden discrimination. A new study, “Dynamic Pricing with Fairness Constraints,” by Maxime C. Cohen, Sentao Miao, and Yining Wang, shows that firms can learn demand while staying fair at the same time. The authors embed two complementary notions of fairness into the classic learning-and-earning problem. The first, price fairness, limits price gaps across customer groups and over time, whereas the second, demand fairness, keeps realized demand shares balanced. To enforce price fairness, the authors design FaPU, an infrequently updated upper confidence bound algorithm that respects both group and temporal limits while securing near-optimal regret and matching lower bounds. For demand fairness, they propose FaPD, a primal-dual learner that meets aggregate demand quotas with high probability and the same near-optimal regret rate. Beyond providing tight theoretical analyses, the paper quantifies the “price of fairness” and outlines extensions to non-stationary markets, offering regulators and practitioners evidence that equity and profitability can coexist in algorithmic pricing.

1 September 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
SMSentao Miao
Sentao Miao
XCXiuli Chao
Xiuli Chao
Problem definition: Consider an online personalized assortment optimization problem in which customers arrive sequentially and make their decisions (e.g., click an ad, purchase a product) following the multinomial logit choice model with unknown parameters. Utilizing a customer’s personal information that is high-dimensional, the firm selects an assortment tailored for each individual customer’s preference. Academic/practical relevance: High dimensionality of a customer’s contextual information is prevalent in real applications, and it creates tremendous computational challenge in online personalized optimization. Methodology: In this paper, an efficient learning algorithm is developed to tackle the computational complexity issue while maintaining satisfactory performance. The algorithm first applies a random projection for dimension reduction and incorporates an online convex optimization procedure for parameter estimation, thus overcoming the issue of linearly increasing computational requirement as data accumulates. Then, it integrates the upper confidence bound method to balance the exploration and revenue exploitation. Results: The theoretical performance of the algorithm in terms of regret is derived under some plausible sparsity assumption on personal information that is observed in real data, and numerical experiments using both synthetic data and a real data set from Yahoo! show that the algorithm performs very well, having scalability and significant advantage in computational time compared with benchmark methods. Managerial implications: Our findings suggest that practitioners should process high-dimensional sparse customer data with an appropriate feature engineering technique, such as random projection (instead of abandoning the sparse portion) to maximize the effectiveness of online optimization algorithms.

1 November 2023 in Operations Research
Verified
Journal Article
Closed access
RBRecep Yusuf Bekci
Recep Yusuf Bekci
MGMehmet Gümüş
Mehmet Gümüş
SMSentao Miao
Sentao Miao
Efficient Learning Algorithms for Dynamic Inventory Allocation in Multiwarehouse Multistore Systems with Censored Demand Motivated by collaboration with a prominent fast-fashion retailer in Europe, the researchers focus their attention on the one-warehouse multistore (OWMS) inventory control problem, specifically addressing scenarios in which the demand distribution is unknown a priori. The OWMS problem revolves around a central warehouse that receives initial replenishments and subsequently distributes inventory to multiple stores within a finite time horizon. The objective lies in minimizing the total expected cost. To overcome the hurdles posed by the unknown demand distribution, the researchers propose a primal-dual algorithm that continuously learns from demand observations and dynamically adjusts inventory control decisions in real time. Thorough theoretical analysis and empirical evaluations highlight the promising performance of this approach, offering valuable insights for efficient inventory allocation within the ever-evolving retail industry.

1 May 2025 in Operations Research
Verified
Journal Article
Closed access
XCXiuli Chao
Xiuli Chao
SJStefanus Jasin
Stefanus Jasin
SMSentao Miao
Sentao Miao
Adaptive Lagrangian Policies for Inventory Control Consider the problem of managing inventory in a multiwarehouse, multistore setting where each store can be periodically replenished from potentially a set of nearby warehouses. This is a practically relevant problem, and its optimal policy is not easy to compute because of the curse of dimensionality. Existing works in the literature have proposed a policy based on Lagrangian relaxation of the original stochastic problem. This vanilla policy applies the control parameters derived from the Lagrangian model and has been shown to perform well in some cases. In “Adaptive Lagrangian Policies for a Multiwarehouse, Multistore Inventory System with Lost Sales,” we go one step farther and develop adaptive Lagrangian policies that update (at certain update times) the control parameters of the vanilla policy based on the historical demand realizations. We analytically show that our proposed adjustment significantly improves the performance of the vanilla policy.