Xiaobei Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaobei Shen has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Yimin Yu
City University of Hong Kong
4 shared publications - Jing-Sheng Song
Fuqua School of Business, Duke University, Durham, North Carolina 27708
2 shared publications Bingfeng Li
1 shared publicationChenhong Cao
1 shared publication- Gongbing Bi
School of Management, University of Science and Technology of China, Hefei, China
1 shared publication Haoxiang Liu
1 shared publication
Latest Publications
- 6 August 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
A hybrid stacked learning framework with temporal dependency representation for high-dimensional demand prediction
- 6 August 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
A hybrid stacked learning framework with temporal dependency representation for high-dimensional demand prediction
- 1 July 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (4) , 1209-1226
Quality Signaling in Rewards-Based Crowdfunding: The Role of Deferred Payments
Problem definition: The rise of crowdfunding hides a flaw: creators’ private information that is unobservable enables them to exploit backers, stalling the sector. To shield backers, platforms now escrow part of raised funds as deferred-payment insurance. We explore whether the implementation of deferred payment (DePay) shapes quality signaling under private information and how to utilize DePay for better campaign outcomes. Methodology/results: We build a stylized signaling game with a representative creator. In current practice, DePay is mandatory, and the creator can only signal quality by raising the funding target (instrument T) or cutting the reward price (instrument P). We instead propose to let DePay be voluntary: the creator decides whether to adopt it and even how large a share to defer, thereby creating a novel signaling instrument D. In the “all-or-nothing” funding, the implementation of DePay guarantees a separating equilibrium, and any of T, P, or D may be effective. Contrary to the literature that crowns T as the unique optimal instrument, we show that (i) P dominates T when the platform sets a low reserve ratio under DePay, and (ii) D outperforms both T and P when the creator determines the reserve ratio, yielding a win-win for backers and the creator. In the “keep-it-all” funding, DePay is indispensable for a (preferred) separating equilibrium because T collapses; nevertheless, voluntary DePay does not always outperform mandatory DePay. Managerial implications: Our results support the implementation of suitably designed DePay by crowdfunding platforms to protect backers, specifying when DePay should be mandatory or voluntary. We also illustrate how creators leverage DePay to signal quality, offering guidance for their campaign design. Funding: J. Lyu acknowledges financial support from the Natural Science Foundation of China [Grant 72401270] and the Fundamental Research Funds for the Central Universities [Grant WK2040000098]. X. Shen acknowledges financial support from the Natural Science Foundation of China [Grants 72222015, 72571260, 72171215]. The research of X. Kong is supported by the Natural Science Foundation of China [Grants 72471213 and 72101243] and the USTC Research Funds of the Double First-Class Initiative [Grant YD2040002025]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0402 .
- 1 July 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (4) , 1209-1226
Quality Signaling in Rewards-Based Crowdfunding: The Role of Deferred Payments
Problem definition: The rise of crowdfunding hides a flaw: creators’ private information that is unobservable enables them to exploit backers, stalling the sector. To shield backers, platforms now escrow part of raised funds as deferred-payment insurance. We explore whether the implementation of deferred payment (DePay) shapes quality signaling under private information and how to utilize DePay for better campaign outcomes. Methodology/results: We build a stylized signaling game with a representative creator. In current practice, DePay is mandatory, and the creator can only signal quality by raising the funding target (instrument T) or cutting the reward price (instrument P). We instead propose to let DePay be voluntary: the creator decides whether to adopt it and even how large a share to defer, thereby creating a novel signaling instrument D. In the “all-or-nothing” funding, the implementation of DePay guarantees a separating equilibrium, and any of T, P, or D may be effective. Contrary to the literature that crowns T as the unique optimal instrument, we show that (i) P dominates T when the platform sets a low reserve ratio under DePay, and (ii) D outperforms both T and P when the creator determines the reserve ratio, yielding a win-win for backers and the creator. In the “keep-it-all” funding, DePay is indispensable for a (preferred) separating equilibrium because T collapses; nevertheless, voluntary DePay does not always outperform mandatory DePay. Managerial implications: Our results support the implementation of suitably designed DePay by crowdfunding platforms to protect backers, specifying when DePay should be mandatory or voluntary. We also illustrate how creators leverage DePay to signal quality, offering guidance for their campaign design. Funding: J. Lyu acknowledges financial support from the Natural Science Foundation of China [Grant 72401270] and the Fundamental Research Funds for the Central Universities [Grant WK2040000098]. X. Shen acknowledges financial support from the Natural Science Foundation of China [Grants 72222015, 72571260, 72171215]. The research of X. Kong is supported by the Natural Science Foundation of China [Grants 72471213 and 72101243] and the USTC Research Funds of the Double First-Class Initiative [Grant YD2040002025]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0402 .
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (1) , 255-270
Dynamic Pricing and Inventory Control for Substitutable Products Based on Market Conditions
Problem definition: We study optimal integrated inventory and pricing decisions for substitutable products over a finite planning horizon with full backlogging and nonstationary costs and demands. The objective is to maximize the total expected discounted profit. Methodology/results: We present a unified demand model that encompasses many commonly used models in the literature. We show that the dynamic optimization problem is jointly concave in inventory and market-share vectors. This enables us to characterize the optimal integrated policy and develop exact algorithms to compute it. In each period, the optimal policy first pinpoints products that are overstocked and thus require no replenishment. It then specifies the optimal base-stock levels for the understocked products and the optimal market shares (and prices) for all products, contingent on the overstock levels. We also establish conditions under which the optimal base-stock levels decrease in the overstock levels, hence significantly simplifying computation. Additionally, we devise several computationally efficient heuristic policies aligned with the optimal policy structure and conduct numerical studies to gain insights. Managerial implications: Our study reveals the importance of accounting for overstocking risks for substitutable products in dynamic markets. Implementing an overstock-adjusted inventory and pricing strategy is particularly crucial during declining demand or when costs and demand fluctuate. The heuristic policies inspired by our optimal policy provide efficient and interpretable methods for quantifying critical trade-offs between inventory and pricing among substitutable products. Funding: X. Shen acknowledges financial support from the National Science Foundation of China [Grants 72222015, 72171215, and 72571260]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.0227 .
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (1) , 255-270
Dynamic Pricing and Inventory Control for Substitutable Products Based on Market Conditions
Problem definition: We study optimal integrated inventory and pricing decisions for substitutable products over a finite planning horizon with full backlogging and nonstationary costs and demands. The objective is to maximize the total expected discounted profit. Methodology/results: We present a unified demand model that encompasses many commonly used models in the literature. We show that the dynamic optimization problem is jointly concave in inventory and market-share vectors. This enables us to characterize the optimal integrated policy and develop exact algorithms to compute it. In each period, the optimal policy first pinpoints products that are overstocked and thus require no replenishment. It then specifies the optimal base-stock levels for the understocked products and the optimal market shares (and prices) for all products, contingent on the overstock levels. We also establish conditions under which the optimal base-stock levels decrease in the overstock levels, hence significantly simplifying computation. Additionally, we devise several computationally efficient heuristic policies aligned with the optimal policy structure and conduct numerical studies to gain insights. Managerial implications: Our study reveals the importance of accounting for overstocking risks for substitutable products in dynamic markets. Implementing an overstock-adjusted inventory and pricing strategy is particularly crucial during declining demand or when costs and demand fluctuate. The heuristic policies inspired by our optimal policy provide efficient and interpretable methods for quantifying critical trade-offs between inventory and pricing among substitutable products. Funding: X. Shen acknowledges financial support from the National Science Foundation of China [Grants 72222015, 72171215, and 72571260]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.0227 .
- Open Access
- 1 January 2024
- Published by HICSS Conference Office
What Influences Behavioral Loyalty on Airbnb? Analyzing the Factors Affecting Repurchase of Listings
This study explores the factors (i.e., various features of listings) that may affect repurchase of listings on Airbnb. The results show that host score has a significant positive effect on repurchase, while listing score is negatively associated with repurchase. When considering the moderating effect of price, higher listing score are more likely to encourage consumers to repeat purchase among high-priced listings. In contrast, the findings show a negative correlation between listing score and repurchase among low-priced listings. Additionally, the findings suggest these joint effects of price and listing score only exists when listing score is higher than host score. Our results offer guidance for hosts on Airbnb to develop effective marketing strategies to foster consumer loyalty and encourage repurchase.
- 1 January 2024
- Published by HICSS Conference Office
Open AccessWhat Influences Behavioral Loyalty on Airbnb? Analyzing the Factors Affecting Repurchase of Listings
This study explores the factors (i.e., various features of listings) that may affect repurchase of listings on Airbnb. The results show that host score has a significant positive effect on repurchase, while listing score is negatively associated with repurchase. When considering the moderating effect of price, higher listing score are more likely to encourage consumers to repeat purchase among high-priced listings. In contrast, the findings show a negative correlation between listing score and repurchase among low-priced listings. Additionally, the findings suggest these joint effects of price and listing score only exists when listing score is higher than host score. Our results offer guidance for hosts on Airbnb to develop effective marketing strategies to foster consumer loyalty and encourage repurchase.
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (4) , 2310-2327
Optimal Policies for a Multi-Echelon Inventory Problem with Service Time Target and Expediting
Problem definition: We study the optimal inventory ordering, expediting, and allocation decisions in a multiechelon supply chain over a finite horizon, in which customer orders are quoted with a fixed fulfillment time window, termed the service time target (STT). Academic/practical relevance: Service time target is commonly used as a marketing strategy to increase customer satisfaction and strengthen firms’ competitive edge. However, how to efficiently manage a multistage supply chain to meet the target has received relatively scant attention in the literature. Our study fills this gap. Methodology: We use dynamic programming to characterize the optimal policy. Results: We show that an echelon base stock policy and a rationing policy are optimal for inventory ordering and inventory allocation/expediting, respectively. We also develop a polynomial-time algorithm to compute the optimal policy. To derive these results, we uncover a new functional property named the decomposable of degree 2 property, which is a nontrivial generalization of the celebrated Clark-Scarf decomposition. This property further allows us to derive induced penalty and compensation to coordinate a decentralized serial system with STT and expediting. Managerial implications: Our result provides an efficient decision tool for managing centralized and decentralized serial supply chains with STT and expediting. Our model can be used to quantify the tradeoff between marketing and operational decisions, such as the impact of a marginal reduction in STT on system cost and expedition frequency, as explored in our numerical studies.
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (4) , 2310-2327
Optimal Policies for a Multi-Echelon Inventory Problem with Service Time Target and Expediting
Problem definition: We study the optimal inventory ordering, expediting, and allocation decisions in a multiechelon supply chain over a finite horizon, in which customer orders are quoted with a fixed fulfillment time window, termed the service time target (STT). Academic/practical relevance: Service time target is commonly used as a marketing strategy to increase customer satisfaction and strengthen firms’ competitive edge. However, how to efficiently manage a multistage supply chain to meet the target has received relatively scant attention in the literature. Our study fills this gap. Methodology: We use dynamic programming to characterize the optimal policy. Results: We show that an echelon base stock policy and a rationing policy are optimal for inventory ordering and inventory allocation/expediting, respectively. We also develop a polynomial-time algorithm to compute the optimal policy. To derive these results, we uncover a new functional property named the decomposable of degree 2 property, which is a nontrivial generalization of the celebrated Clark-Scarf decomposition. This property further allows us to derive induced penalty and compensation to coordinate a decentralized serial system with STT and expediting. Managerial implications: Our result provides an efficient decision tool for managing centralized and decentralized serial supply chains with STT and expediting. Our model can be used to quantify the tradeoff between marketing and operational decisions, such as the impact of a marginal reduction in STT on system cost and expedition frequency, as explored in our numerical studies.
- 19 November 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70 (4)
Technical Note—A Permutation-Dependent Separability Approach for Capacitated Two-Echelon Inventory Systems
We consider optimal inventory replenishment policies for capacitated 2-echelon serial inventory systems, where the capacity of upstream echelon can be the bottleneck. We show that the optimal replenishment decisions in each period can be made one echelon at a time by introducing a procedure that can sequentially decompose a multidimensional optimization problem to a series of one-dimensional problems. We also introduce the notion of permutation-dependent separability. A permutation-dependent separable function is a function that can be decomposed as a sum of single-variable component functions under each nondecreasing order of variables. We find that the value function for the capacitated 2-echelon system in each period is permutation-dependent separable, and that, for each echelon, a permutation-dependent echelon base stock policy is optimal.
- 19 November 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70 (4)
Technical Note—A Permutation-Dependent Separability Approach for Capacitated Two-Echelon Inventory Systems
We consider optimal inventory replenishment policies for capacitated 2-echelon serial inventory systems, where the capacity of upstream echelon can be the bottleneck. We show that the optimal replenishment decisions in each period can be made one echelon at a time by introducing a procedure that can sequentially decompose a multidimensional optimization problem to a series of one-dimensional problems. We also introduce the notion of permutation-dependent separability. A permutation-dependent separable function is a function that can be decomposed as a sum of single-variable component functions under each nondecreasing order of variables. We find that the value function for the capacitated 2-echelon system in each period is permutation-dependent separable, and that, for each echelon, a permutation-dependent echelon base stock policy is optimal.
- 1 May 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (3) , 1371-1392
Crowdsourcing contests with entry cost
- 1 May 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (3) , 1371-1392
Crowdsourcing contests with entry cost
- 13 July 2019
- Published by SAGE Publications in Production and Operations Management
- Vol. 28 (11) , 2792-2807
Capacity Allocation with Multiple Suppliers and Multiple Demand Classes
We consider the capacity allocation problem for a retailer with multiple suppliers and multiple demand classes. The retailer offers one seasonal product and reserves capacity from multiple suppliers. Customers in different classes are charged with different selling prices for the same product. We analyze the optimal capacity allocation policies with the following three types of customers: (i) patient customers, (ii) impatient customers, and (iii) customers with limited patience. To empower our analysis, we propose a new preservation property of decomposition under a maximization operator. Based on the preservation property, we show that the value function in each period is decomposable for each type of customers. We then characterize the optimal capacity allocation policy for each type of customers and develop an efficient algorithm to obtain the respective optimal policy by exploiting decomposition. We also numerically investigate the optimal policy and show its value against a counterpart static heuristic policy. Finally, we extend our results to systems with multiple products, new capacity additions, etc.
- 13 July 2019
- Published by SAGE Publications in Production and Operations Management
- Vol. 28 (11) , 2792-2807
Capacity Allocation with Multiple Suppliers and Multiple Demand Classes
We consider the capacity allocation problem for a retailer with multiple suppliers and multiple demand classes. The retailer offers one seasonal product and reserves capacity from multiple suppliers. Customers in different classes are charged with different selling prices for the same product. We analyze the optimal capacity allocation policies with the following three types of customers: (i) patient customers, (ii) impatient customers, and (iii) customers with limited patience. To empower our analysis, we propose a new preservation property of decomposition under a maximization operator. Based on the preservation property, we show that the value function in each period is decomposable for each type of customers. We then characterize the optimal capacity allocation policy for each type of customers and develop an efficient algorithm to obtain the respective optimal policy by exploiting decomposition. We also numerically investigate the optimal policy and show its value against a counterpart static heuristic policy. Finally, we extend our results to systems with multiple products, new capacity additions, etc.
- 30 March 2018
- Published by SAGE Publications in Production and Operations Management
- Vol. 27 (7) , 1355-1367
Coordinating Inventory and Pricing Decisions with General Price‐Dependent Demands
We consider a periodic review, joint inventory and pricing control problem for a firm that faces general random price‐dependent demands. Any unsatisfied demand can be either backordered or lost immediately. The objective is to maximize the expected profit over a finite selling horizon by coordinating the inventory and pricing decisions in each period. For both the backorder model and the lost sales model, we derive some quite general sufficient conditions to ensure the optimality of a base‐stock list price (BSLP) policy based on the strict monotonicity of demand functions in the realizations of random noises. We are among the first to utilize the strict monotonicity of demand functions in the realizations of random noises for deriving the sufficient conditions. We derive the sufficient conditions in both the backorder model and the lost‐sales model by utilizing the new concept of upper‐set and lower‐set decreasing properties (USDP/LSDP), which is a generalized version of the first‐order stochastic dominance. This study reveals that the optimality of a BSLP policy is robust to more general business environments than what we previously thought. Finally, we also apply the USDP/LSDP in other inventory management problems.
- 30 March 2018
- Published by SAGE Publications in Production and Operations Management
- Vol. 27 (7) , 1355-1367
Coordinating Inventory and Pricing Decisions with General Price‐Dependent Demands
We consider a periodic review, joint inventory and pricing control problem for a firm that faces general random price‐dependent demands. Any unsatisfied demand can be either backordered or lost immediately. The objective is to maximize the expected profit over a finite selling horizon by coordinating the inventory and pricing decisions in each period. For both the backorder model and the lost sales model, we derive some quite general sufficient conditions to ensure the optimality of a base‐stock list price (BSLP) policy based on the strict monotonicity of demand functions in the realizations of random noises. We are among the first to utilize the strict monotonicity of demand functions in the realizations of random noises for deriving the sufficient conditions. We derive the sufficient conditions in both the backorder model and the lost‐sales model by utilizing the new concept of upper‐set and lower‐set decreasing properties (USDP/LSDP), which is a generalized version of the first‐order stochastic dominance. This study reveals that the optimality of a BSLP policy is robust to more general business environments than what we previously thought. Finally, we also apply the USDP/LSDP in other inventory management problems.