Yining Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yining Wang has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Xi Chen
Stern School of Business, New York University, New York, New York 10012
14 shared publications - Boxiao Chen
College of Business Administration, University of Illinois Chicago, Chicago, Illinois 60607
5 shared publications - Yuan Zhou
Tsinghua University
5 shared publications - David Simchi-Levi
Institute for Data, Systems, and Society, Department of Civil and Environmental Engineering, and Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
4 shared publications Aarti Singh
Carnegie Mellon University
3 shared publications- He Wang
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (11) , 9478-9500
Capacity and Pricing Management with Demand Learning
In an environment where demand is unknown to the firm, it is important to investigate how capacity adjustment and dynamic pricing can be integrated so that the firm can learn about the demand on the fly while making capacity and pricing decisions. In this paper, we design learning algorithms for the joint capacity and pricing management problem. To evaluate the performance of our algorithms, we consider a large-demand asymptotic regime where the demand and capacity are scaled up with the selling horizon T. We first establish an [Formula: see text] lower bound on the regret under any admissible policy. We propose a novel double-trisection algorithm that utilizes pricing decisions to collect demand information and tune capacity rate levels safely, attaining an [Formula: see text] regret upper bound that matches the lower bound. We then modify our algorithm to address the issue when the number of capacity adjustment opportunities K is limited and find that only a few opportunities to adjust capacity levels (i.e., [Formula: see text]) are sufficient to achieve the optimal regret rate. We also consider seasonal demands and provide a modified algorithm to incorporate the seasonality. We finally conduct numerical experiments on a test bed inspired by public operational and financial data. This paper was accepted by J. George Shanthikumar, data science. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.03749 .
- 1 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (11) , 9478-9500
Capacity and Pricing Management with Demand Learning
In an environment where demand is unknown to the firm, it is important to investigate how capacity adjustment and dynamic pricing can be integrated so that the firm can learn about the demand on the fly while making capacity and pricing decisions. In this paper, we design learning algorithms for the joint capacity and pricing management problem. To evaluate the performance of our algorithms, we consider a large-demand asymptotic regime where the demand and capacity are scaled up with the selling horizon T. We first establish an [Formula: see text] lower bound on the regret under any admissible policy. We propose a novel double-trisection algorithm that utilizes pricing decisions to collect demand information and tune capacity rate levels safely, attaining an [Formula: see text] regret upper bound that matches the lower bound. We then modify our algorithm to address the issue when the number of capacity adjustment opportunities K is limited and find that only a few opportunities to adjust capacity levels (i.e., [Formula: see text]) are sufficient to achieve the optimal regret rate. We also consider seasonal demands and provide a modified algorithm to incorporate the seasonality. We finally conduct numerical experiments on a test bed inspired by public operational and financial data. This paper was accepted by J. George Shanthikumar, data science. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.03749 .
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (2) , 825-839
A Primal-Dual Approach Toward Resource-Constrained Revenue Management with Demand Learning and Large Action Space
New Algorithms Advance Revenue Management with Demand Learning A new study by Sentao Miao (University of Colorado Boulder), Yining Wang (University of Texas at Dallas), and Jiawei Zhang (New York University) introduces efficient algorithms for revenue management when firms face limited resources and uncertain demand. Revenue management, used in industries such as airlines, hotels, and retail, requires dynamic decisions on pricing and product assortments, whereas resources such as seats or inventory cannot be replenished. Traditional approaches often struggle with complexity or weak theoretical guarantees. The authors propose a primal-dual learning framework that combines optimization with machine learning’s upper confidence bound method. Their approach achieves near-optimal regret bounds, remaining computationally efficient even in large or infinite decision spaces. Applications include dynamic assortment selection, network revenue management with generalized linear demand, and joint pricing–assortment optimization. Numerical experiments show the methods consistently outperform benchmarks, offering practical, scalable solutions for data-driven industries.
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (2) , 825-839
A Primal-Dual Approach Toward Resource-Constrained Revenue Management with Demand Learning and Large Action Space
New Algorithms Advance Revenue Management with Demand Learning A new study by Sentao Miao (University of Colorado Boulder), Yining Wang (University of Texas at Dallas), and Jiawei Zhang (New York University) introduces efficient algorithms for revenue management when firms face limited resources and uncertain demand. Revenue management, used in industries such as airlines, hotels, and retail, requires dynamic decisions on pricing and product assortments, whereas resources such as seats or inventory cannot be replenished. Traditional approaches often struggle with complexity or weak theoretical guarantees. The authors propose a primal-dual learning framework that combines optimization with machine learning’s upper confidence bound method. Their approach achieves near-optimal regret bounds, remaining computationally efficient even in large or infinite decision spaces. Applications include dynamic assortment selection, network revenue management with generalized linear demand, and joint pricing–assortment optimization. Numerical experiments show the methods consistently outperform benchmarks, offering practical, scalable solutions for data-driven industries.
- Top Cited Papers
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (3) , 2619-2633
Utility Fairness in Contextual Dynamic Pricing with Demand Learning
This paper introduces a novel contextual bandit algorithm for personalized pricing under utility fairness constraints in scenarios with uncertain demand, achieving an optimal regret upper bound. Our approach, which incorporates dynamic pricing and demand learning, addresses the critical challenge of fairness in pricing strategies. We first delve into the static full-information setting to formulate an optimal pricing policy as a constrained optimization problem. Here, we propose an approximation algorithm for efficiently and approximately computing the ideal policy. We also use mathematical analysis and computational studies to characterize the structures of optimal contextual pricing policies subject to fairness constraints, deriving simplified policies that lay the foundations of more in-depth research and extensions. Further, we extend our study to dynamic pricing problems with demand learning, establishing a nonstandard regret lower bound that highlights the complexity added by fairness constraints. Our research offers a comprehensive analysis of the cost of fairness and its impact on the balance between utility and revenue maximization. This work represents a step toward integrating ethical considerations into algorithmic efficiency in data-driven dynamic pricing. This paper was accepted by J. George Shanthikumar, big data analytics. Funding: X. Chen acknowledges support from the National Science Foundation [Grant IIS-1845444]. D. Simchi-Levi thanks the MIT Data Science Lab for support. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.03956 .
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (3) , 2619-2633
Top Cited PapersUtility Fairness in Contextual Dynamic Pricing with Demand Learning
This paper introduces a novel contextual bandit algorithm for personalized pricing under utility fairness constraints in scenarios with uncertain demand, achieving an optimal regret upper bound. Our approach, which incorporates dynamic pricing and demand learning, addresses the critical challenge of fairness in pricing strategies. We first delve into the static full-information setting to formulate an optimal pricing policy as a constrained optimization problem. Here, we propose an approximation algorithm for efficiently and approximately computing the ideal policy. We also use mathematical analysis and computational studies to characterize the structures of optimal contextual pricing policies subject to fairness constraints, deriving simplified policies that lay the foundations of more in-depth research and extensions. Further, we extend our study to dynamic pricing problems with demand learning, establishing a nonstandard regret lower bound that highlights the complexity added by fairness constraints. Our research offers a comprehensive analysis of the cost of fairness and its impact on the balance between utility and revenue maximization. This work represents a step toward integrating ethical considerations into algorithmic efficiency in data-driven dynamic pricing. This paper was accepted by J. George Shanthikumar, big data analytics. Funding: X. Chen acknowledges support from the National Science Foundation [Grant IIS-1845444]. D. Simchi-Levi thanks the MIT Data Science Lab for support. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.03956 .
- Open Access
- 15 December 2025
- Published by SAGE Publications in Production and Operations Management
- Vol. 35 (5) , 2073-2091
A Re-Solving Heuristic for Dynamic Assortment Optimization With Knapsack Constraints
In this article, we consider a multi-stage assortment optimization problem with multinomial logit (MNL) choice modeling under resource knapsack constraints. Given the current resource inventory levels, the retailer makes an assortment decision at each period, and the goal of the retailer is to maximize the total profit from purchases. With the exact optimal dynamic assortment solution being computationally intractable, a practical strategy is to adopt the re-solving technique that periodically re-optimizes deterministic linear programs (LPs) arising from fluid approximation. However, the fractional structure of MNL makes the fluid approximation in assortment optimization non-linear, which brings new technical challenges. To address this challenge, we propose a new epoch-based re-solving algorithm that effectively transforms the denominator of the objective into the constraint, so that the re-solving technique is applied to a linear program with additional slack variables amenable to practical computations and theoretical analysis. Theoretically, we prove that the regret (i.e., the gap between the re-solving policy and the optimal objective of the fluid approximation) scales logarithmically with the length of time horizon and resource capacities.
- 15 December 2025
- Published by SAGE Publications in Production and Operations Management
- Vol. 35 (5) , 2073-2091
Open AccessA Re-Solving Heuristic for Dynamic Assortment Optimization With Knapsack Constraints
In this article, we consider a multi-stage assortment optimization problem with multinomial logit (MNL) choice modeling under resource knapsack constraints. Given the current resource inventory levels, the retailer makes an assortment decision at each period, and the goal of the retailer is to maximize the total profit from purchases. With the exact optimal dynamic assortment solution being computationally intractable, a practical strategy is to adopt the re-solving technique that periodically re-optimizes deterministic linear programs (LPs) arising from fluid approximation. However, the fractional structure of MNL makes the fluid approximation in assortment optimization non-linear, which brings new technical challenges. To address this challenge, we propose a new epoch-based re-solving algorithm that effectively transforms the denominator of the objective into the constraint, so that the re-solving technique is applied to a linear program with additional slack variables amenable to practical computations and theoretical analysis. Theoretically, we prove that the regret (i.e., the gap between the re-solving policy and the optimal objective of the fluid approximation) scales logarithmically with the length of time horizon and resource capacities.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3065-3084
Estimation of High-Dimensional Contextual Pricing Models with Nonparametric Price Confounders
Which factors affect an individual’s purchase behaviors more, and how would a retailer consistently and reliably identify such factors, with data collected on adaptively offered prices that might potentially interfere with such factors? Our research presents novel methods that effectively estimate demand models with many factors and covariates, consistent with adaptive and contextual pricing practice.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3065-3084
Estimation of High-Dimensional Contextual Pricing Models with Nonparametric Price Confounders
Which factors affect an individual’s purchase behaviors more, and how would a retailer consistently and reliably identify such factors, with data collected on adaptively offered prices that might potentially interfere with such factors? Our research presents novel methods that effectively estimate demand models with many factors and covariates, consistent with adaptive and contextual pricing practice.
- 10 October 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Network Revenue Management with Nonparametric Demand Learning: T-Regret and Polynomial Dimension Dependency
This paper studies the classic price-based network revenue management (NRM) problem with demand learning. The retailer dynamically decides prices of n products over a finite selling season (of length T) subject to m resource constraints, with the purpose of maximizing the cumulative revenue. In this paper, we focus on a nonparametric demand model with some mild technical assumptions which are satisfied by most of the commonly used demand functions. We propose a robust ellipsoid method adapted to the NRM setting in a nontrivial manner. This is the first result which achieves the regret of the form [ ] (where [ ] is a polynomial function of [ ]) in the current literature on the nonparametric NRM problem. Funding: S. Miao gratefully acknowledges financial support provided by the Ruegg Family Scholar and the Leeds School of Business. Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2022.0086 .
- 10 October 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Network Revenue Management with Nonparametric Demand Learning: T-Regret and Polynomial Dimension Dependency
This paper studies the classic price-based network revenue management (NRM) problem with demand learning. The retailer dynamically decides prices of n products over a finite selling season (of length T) subject to m resource constraints, with the purpose of maximizing the cumulative revenue. In this paper, we focus on a nonparametric demand model with some mild technical assumptions which are satisfied by most of the commonly used demand functions. We propose a robust ellipsoid method adapted to the NRM setting in a nontrivial manner. This is the first result which achieves the regret of the form [ ] (where [ ] is a polynomial function of [ ]) in the current literature on the nonparametric NRM problem. Funding: S. Miao gratefully acknowledges financial support provided by the Ruegg Family Scholar and the Leeds School of Business. Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2022.0086 .
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (2) , 819-828
Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback
Optimal Nonstationary Optimization Without Knowing Function Changes Nonstationary stochastic optimization plays a vital role in a number of computer science and operations research applications. It is known how to design and analyze algorithms that optimize a sequence of strongly convex/concave and smooth functions with access to only one-point noisy function values with the underlying function sequence subject to maximum magnitude of function changes. In recent work from Wang titled “Technical Note: On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback,” an optimization algorithm is designed and analyzed without assuming the magnitude of function changes is known in advance. Optimality of the designed algorithm is demonstrated.
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (2) , 819-828
Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback
Optimal Nonstationary Optimization Without Knowing Function Changes Nonstationary stochastic optimization plays a vital role in a number of computer science and operations research applications. It is known how to design and analyze algorithms that optimize a sequence of strongly convex/concave and smooth functions with access to only one-point noisy function values with the underlying function sequence subject to maximum magnitude of function changes. In recent work from Wang titled “Technical Note: On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback,” an optimization algorithm is designed and analyzed without assuming the magnitude of function changes is known in advance. Optimality of the designed algorithm is demonstrated.
- 27 January 2025
- Published by Springer Nature in Computational Economics
- Vol. 66 (6) , 4621-4643
Technical Note: Maximum Likelihood Optimization via Parallel Estimating Gradient Ascent
- 27 January 2025
- Published by Springer Nature in Computational Economics
- Vol. 66 (6) , 4621-4643
Technical Note: Maximum Likelihood Optimization via Parallel Estimating Gradient Ascent
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 72 (6) , 2446-2466
Pricing and Positioning of Horizontally Differentiated Products with Incomplete Demand Information
How to Manage Horizontally Differentiated Products When Customer Preferences and Demand Distributions Are Unknown In the paper “Pricing and Positioning of Horizontally Differentiated Products with Incomplete Demand Information,” we consider the problem of determining the optimal prices and product configurations of horizontally differentiated products when customers purchase according to a locational choice model and where the problem parameters are initially unknown to the decision maker. We propose a data-driven algorithm that learns the optimal prices and product configurations from accumulating sales data, and we show that their regret—the expected cumulative loss caused by not using optimal decisions—after T time periods is [ ]. We accompany this result by proving an almost-matching lower bound of regret, implying that our algorithms are asymptotically near optimal. In an extension, we show how our algorithm can be adapted for the case of fixed locations.
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 72 (6) , 2446-2466
Pricing and Positioning of Horizontally Differentiated Products with Incomplete Demand Information
How to Manage Horizontally Differentiated Products When Customer Preferences and Demand Distributions Are Unknown In the paper “Pricing and Positioning of Horizontally Differentiated Products with Incomplete Demand Information,” we consider the problem of determining the optimal prices and product configurations of horizontally differentiated products when customers purchase according to a locational choice model and where the problem parameters are initially unknown to the decision maker. We propose a data-driven algorithm that learns the optimal prices and product configurations from accumulating sales data, and we show that their regret—the expected cumulative loss caused by not using optimal decisions—after T time periods is [ ]. We accompany this result by proving an almost-matching lower bound of regret, implying that our algorithms are asymptotically near optimal. In an extension, we show how our algorithm can be adapted for the case of fixed locations.
- 1 May 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 70 (5) , 3362-3380
Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands
We study the classic model of joint pricing and inventory control with lost sales over T consecutive review periods. The firm does not know the demand distribution a priori and needs to learn it from historical censored demand data. We develop nonparametric online learning algorithms that converge to the clairvoyant optimal policy at the fastest possible speed. The fundamental challenges rely on that neither zeroth-order nor first-order feedbacks are accessible to the firm and reward at any single price is not observable due to demand censoring. We propose a novel inversion method based on empirical measures to consistently estimate the difference of the instantaneous reward functions at two prices, directly tackling the fundamental challenge brought by censored demands. Based on this technical innovation, we design bisection and trisection search methods that attain an [ ] regret for the case with concave reward functions, and we design an active tournament elimination method that attains [ ] regret when the reward functions are nonconcave. We complement the [ ] regret upper bound with a matching [ ] regret lower bound. The lower bound is established by a novel information-theoretical argument based on generalized squared Hellinger distance, which is significantly different from conventional arguments that are based on Kullback-Leibler divergence. Both the upper bound technique based on the “difference estimator” and the lower bound technique based on generalized Hellinger distance are new in the literature, and can be potentially applied to solve other inventory or censored demand type problems that involve learning. This paper was accepted by Jeannette Song, operations management. Supplemental Material: The data files and online appendix are available at https://doi.org/10.1287/mnsc.2023.4859 .
- 1 May 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 70 (5) , 3362-3380
Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands
We study the classic model of joint pricing and inventory control with lost sales over T consecutive review periods. The firm does not know the demand distribution a priori and needs to learn it from historical censored demand data. We develop nonparametric online learning algorithms that converge to the clairvoyant optimal policy at the fastest possible speed. The fundamental challenges rely on that neither zeroth-order nor first-order feedbacks are accessible to the firm and reward at any single price is not observable due to demand censoring. We propose a novel inversion method based on empirical measures to consistently estimate the difference of the instantaneous reward functions at two prices, directly tackling the fundamental challenge brought by censored demands. Based on this technical innovation, we design bisection and trisection search methods that attain an [ ] regret for the case with concave reward functions, and we design an active tournament elimination method that attains [ ] regret when the reward functions are nonconcave. We complement the [ ] regret upper bound with a matching [ ] regret lower bound. The lower bound is established by a novel information-theoretical argument based on generalized squared Hellinger distance, which is significantly different from conventional arguments that are based on Kullback-Leibler divergence. Both the upper bound technique based on the “difference estimator” and the lower bound technique based on generalized Hellinger distance are new in the literature, and can be potentially applied to solve other inventory or censored demand type problems that involve learning. This paper was accepted by Jeannette Song, operations management. Supplemental Material: The data files and online appendix are available at https://doi.org/10.1287/mnsc.2023.4859 .