skip to main content


Title: Pricing during Disruptions: Order Variability versus Profit
ABSTRACT

When supply disruptions occur, firms want to employ an effective pricing strategy to reduce losses. However, firms typically do not know precisely how customers will react to price changes in the short term, during a disruption. In this article, we investigate the customer's order variability and the firm's profit under several representative heuristic pricing strategies, including no change at all (fixed pricing strategy), changing the price only (naive pricing strategy), and adjusting the belief and price simultaneously (one‐period correction [1PC] and regression pricing strategies). We show that the fixed pricing strategy creates the most stable customer order process, but it brings lower profit than the naive pricing strategy in most cases. The 1PC pricing strategy produces a more volatile customer order process and smaller profit than the naive one does. Although the regression pricing strategy is a more advanced approach, it leads to lower profit and greater customer order variability than the naive pricing strategy (but the opposite when compared to the 1PC strategy). We conclude that (i) completely eliminating the customer order variability by employing a fixed pricing strategy is not advisable and adjusting the price to match supply with demand is necessary to improve the profit; (ii) frequently adjusting the belief about customer behaviors under imperfect information may increase the customer's order variability and reduce the firm's profit. The conclusions are robust to the inventory assumption (i.e., without or with inventory carryover) and the firm's objective (i.e., market clearance or profit maximization).

 
more » « less
NSF-PAR ID:
10445152
Author(s) / Creator(s):
 ;  ;  ;  
Publisher / Repository:
Wiley-Blackwell
Date Published:
Journal Name:
Decision Sciences
Volume:
53
Issue:
4
ISSN:
0011-7315
Page Range / eLocation ID:
p. 646-680
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. The rise of online marketplaces has raised customer expectations regarding customization and lead time. It poses significant challenges to manufacturing firms and prompts a move from make-to-stock to a more flexible make-to-order system. Compared to make-to-stock settings, make-to-order systems cannot smooth fluctuations in demand using available stock. While viewing dynamic pricing as a useful strategy to balance supply with demand, many manufacturing firms can also create capacity flexibility. In that scenario, system costs could be cut by managing capacity and demand simultaneously. In this paper, we consider a make-to-order production environment with base and surge capacity as well as the ability to adjust product pricing. Our main focus is on operational decision-making, assuming that the base capacity and surge capacity are fixed, but activating the surge capacity incurs a setup cost. Initially, we propose a stochastic control model to reflect this complex decision problem. However, our initial model leads to an intractable dynamic programming problem. To overcome this, we convert the problem to a more tractable diffusion control problem. This approach helps to reveal the conditions under which utilizing flexible capacity is more advantageous than relying solely on fixed capacity. When flexible capacity is advantageous, we provide a solution to the diffusion control problem that can guide optimal capacity and price adjustments. We discover an interesting interplay between capacity adjustment and dynamic pricing. In particular, we find that the price, which aims at reducing congestion, may not monotonically increase with the congestion level when capacity adjustments incur a fixed cost.

     
    more » « less
  2. This paper studies an inventory management problem faced by an upstream supplier that is in a collaborative agreement, such as vendor-managed inventory (VMI), with a retailer. A VMI partnership provides the supplier an opportunity to manage in- ventory for the supply chain in exchange for point-of-sales (POS)- and inventory-level information from the retailer. However, retailers typically possess superior local market information and as has been the case in recent years, are able to capture and analyze customer purchasing behavior beyond the traditional POS data. Such analyses provide the retailer access to market signals that are otherwise hard to capture using POS information. We show and quantify the implication of the financial obligations of each party in VMI that renders communication of such important market signals as noncredible. To help insti- tute a sound VMI collaboration, we propose learn and screen—a dynamic inventory mechanism—for the supplier to effectively manage inventory and information in the supply chain. The proposed mechanism combines the ability of the supplier to learn about market conditions from POS data (over multiple selling periods) and dynamically de- termine when to screen the retailer and acquire his private demand information. Inventory decisions in the proposed mechanism serve a strategic purpose in addition to their classic role of satisfying customer demand. We show that our proposed dynamic mechanism significantly improves the supplier’s expected profit and increases the efficiency of the overall supply chain operations under a VMI agreement. In addition, we determine the market conditions in which a strategic approach to VMI results in significant profit im- provements for both firms, particularly when the retailer has high market power (i.e., when the supplier highly depends on the retailer) and when the supplier has relatively less knowledge about the end customer/market compared with the retailer. 
    more » « less
  3. We consider the periodic review dynamic pricing and inventory control problem with fixed ordering cost. Demand is random and price dependent, and unsatisfied demand is backlogged. With complete demand information, the celebrated [Formula: see text] policy is proved to be optimal, where s and S are the reorder point and order-up-to level for ordering strategy, and [Formula: see text], a function of on-hand inventory level, characterizes the pricing strategy. In this paper, we consider incomplete demand information and develop online learning algorithms whose average profit approaches that of the optimal [Formula: see text] with a tight [Formula: see text] regret rate. A number of salient features differentiate our work from the existing online learning researches in the operations management (OM) literature. First, computing the optimal [Formula: see text] policy requires solving a dynamic programming (DP) over multiple periods involving unknown quantities, which is different from the majority of learning problems in OM that only require solving single-period optimization questions. It is hence challenging to establish stability results through DP recursions, which we accomplish by proving uniform convergence of the profit-to-go function. The necessity of analyzing action-dependent state transition over multiple periods resembles the reinforcement learning question, considerably more difficult than existing bandit learning algorithms. Second, the pricing function [Formula: see text] is of infinite dimension, and approaching it is much more challenging than approaching a finite number of parameters as seen in existing researches. The demand-price relationship is estimated based on upper confidence bound, but the confidence interval cannot be explicitly calculated due to the complexity of the DP recursion. Finally, because of the multiperiod nature of [Formula: see text] policies the actual distribution of the randomness in demand plays an important role in determining the optimal pricing strategy [Formula: see text], which is unknown to the learner a priori. In this paper, the demand randomness is approximated by an empirical distribution constructed using dependent samples, and a novel Wasserstein metric-based argument is employed to prove convergence of the empirical distribution. This paper was accepted by J. George Shanthikumar, big data analytics. 
    more » « less
  4. We consider a fundamental pricing model in which a fixed number of units of a reusable resource are used to serve customers. Customers arrive to the system according to a stochastic process and, upon arrival, decide whether to purchase the service, depending on their willingness to pay and the current price. The service time during which the resource is used by the customer is stochastic, and the firm may incur a service cost. This model represents various markets for reusable resources, such as cloud computing, shared vehicles, rotable parts, and hotel rooms. In the present paper, we analyze this pricing problem when the firm attempts to maximize a weighted combination of three central metrics: profit, market share, and service level. Under Poisson arrivals, exponential service times, and standard assumptions on the willingness-to-pay distribution, we establish a series of results that characterize the performance of static pricing in such environments. In particular, although an optimal policy is fully dynamic in such a context, we prove that a static pricing policy simultaneously guarantees 78.9% of the profit, market share, and service level from the optimal policy. Notably, this result holds for any service rate and number of units the firm operates. Our proof technique relies on a judicious construction of a static price that is derived directly from the optimal dynamic pricing policy. In the special case in which there are two units and the induced demand is linear, we also prove that the static policy guarantees 95.5% of the profit from the optimal policy. Our numerical findings on a large test bed of instances suggest that the latter result is quite indicative of the profit obtained by the static pricing policy across all parameters. 
    more » « less
  5. This paper develops competitive bidding strategies for an online linear optimization problem with inventory management constraints in both cost minimization and profit maximization settings. In the minimization problem, a decision maker should satisfy its time-varying demand by either purchasing units of an asset from the market or producing them from a local inventory with limited capacity. In the maximization problem, a decision maker has a time-varying supply of an asset that may be sold to the market or stored in the inventory to be sold later. In both settings, the market price is unknown in each timeslot and the decision maker can submit a finite number of bids to buy/sell the asset. Once all bids have been submitted, the market price clears and the amount bought/sold is determined based on the clearing price and submitted bids. From this setup, the decision maker must minimize/maximize their cost/profit in the market, while also devising a bidding strategy in the face of an unknown clearing price. We propose DEMBID and SUPBID, two competitive bidding strategies for these online linear optimization problems with inventory management constraints for the minimization and maximization setting respectively. We then analyze the competitive ratios of the proposed algorithms and show that the performance of our algorithms approaches the best possible competitive ratio as the maximum number of bids increases. As a case study, we use energy data traces from Akamai data centers, renewable outputs from NREL, and energy prices from NYISO to show the effectiveness of our bidding strategies in the context of energy storage management for a large energy customer participating in a real-time electricity market. 
    more » « less