Up Then Down: Bid‐Price Trends in Revenue Management

In the classic revenue management (RM) problem of selling a fixed quantity of perishable inventories to price‐sensitive non‐strategic consumers over a finite horizon, the optimal pricing decision at any time depends on two important factors: consumer valuation and bid price. The former is determined exogenously by the demand side, while the latter is determined jointly by the inventory level on the supply side and the consumer valuations in the time remaining within the selling horizon. Because of the importance of bid prices in theory and practice of RM, this study aims to enhance the understanding of the intertemporal behavior of bid prices in dynamic RM environments. We provide a probabilistic characterization of the optimal policies from the perspective of bid‐price processes. We show that an optimal bid‐price process has an upward trend over time before the inventory level falls to one and then has a downward trend. This intertemporal up‐then‐down pattern of bid‐price processes is related to two fundamental static properties of the optimal bid prices: (i) At any given time, a lower inventory level yields a higher optimal bid price, which is referred to as the resource scarcity effect; (ii) Given any inventory level, the optimal bid price decreases with time; that is referred to as the resource perishability effect. The demonstrated upward trend implies that the optimal bid‐price process is mainly driven by the resource scarcity effect, while the downward trend implies that the bid‐price process is mainly driven by the resource perishability effect. We also demonstrate how optimal bid price and consumer valuation, as two competing forces, interact over time to drive the optimal‐price process. The results are also extended to the network RM problems.     

Bounds of Relative Regret Limit in p‐Robust Supply Chain Network Design

This research studies the p‐robust supply chain network design with uncertain demand and cost scenarios. The optimal design integrates the supplier selection together with the facility location and capacity problem. We provide a new framework to obtain the relative regret limit, which is critical in the robust supply chain design but is assumed to be a known value in the existing literature. We obtain lower and upper bounds for relative regret limit and obtain a sequence of optimal solutions for series relative regret limits between the upper and lower bounds. An algorithm for p‐robust supply chain network design is provided. A series of numerical examples are designed to find the properties of the bottleneck scenarios. A scenario with low probability and a low optimal objective function value for the scenario has a greater chance of being a bottleneck. To focus only on the influence from the relative regret, we also introduce three separate new objective functions in p‐robust design. The proposed new theories and approaches provide a sequence of options for decision makers to reduce the marketing risks effectively in supply chain network design.     

Coordinating Service‐Sensitive Demand and Capacity by Adaptive Decision Making: An Application of Case‐Based Decision Theory*

The subject of this article is the simultaneous choice of product price and manufacturing capacity if demand is stochastic and service‐level sensitive. In this setting, capacity as well as price have an impact on demand because several aspects of service level depend on capacity. For example, delivery time will be reduced if capacity is increased given a constant demand rate. We illustrate the relationship between service level, capacity, and demand reaction by a stylized application problem from the after‐sales services industry. The reaction of customers to variations in service level and price is represented by a kinked price‐demand‐rate function. We first derive the optimal price‐capacity combination for the resulting decision problem under full information. Subsequently, we focus on a decision maker (DM) who lacks complete knowledge of the demand function. Hence the DM is unable to anticipate the service level and consequently cannot identify the optimal solution. However, the DM will acquire additional information during the sales process and use it in subsequent revisions of the price‐capacity decision. Thus, this decision making is adaptive and based on experience. In contrast to the literature, which assumes certain repetitive procedures somewhat ad hoc, we develop an adaptive decision process based on case‐based decision theory (CBDT) for the price‐capacity problem. Finally, we show that a CBDT DM in our setting eventually finds the optimal solution, if the DM sets the price based on absorption costs and adequately adjusts the capacity with respect to the observed demand.     

The price-setting newsvendor with service and loss constraints

Current performance measurement systems consider not only financial measures, like costs and profits, but also non-financial indicators with respect to customer service, quality and flexibility. Using the newsvendor model, we analyse the respective influence of these possibly conflicting performance measures on important operations and marketing decisions, for instance the order quantity and the selling price of a product. As in the classical newsvendor model for price-independent as well as price-dependent demand distribution, the objective of the firm is to maximise expected profit. In this paper, we also consider a service constraint—a lower bound for the level of product availability—and a loss constraint—an upper bound for the probability of a loss occurring. For both models, we provide conditions for the existence of solutions. We then analyse the influence of demand variability using a set of conditions specifying the quantiles of the predetermined performance measures: a higher variability of demand implies a smaller admissible region of the decision variables. In the price-independent case, the optimal solution has a control-limit structure: the optimal order quantity is thus given either by the classical newsvendor solution or by the control-limits corresponding to the constraints. In the price-setting model with multiplicative demand, this structure is used to check whether small admissible prices are determined by the service constraint or by the loss constraint. Using these structural results, a procedure is developed to more easily enable the computation of the optimal values of the order quantity, selling price and expected profit.     

A Note on the Relationship Among Capacity,Pricing, and Inventory in a Make‐to‐Stock System

We address the simultaneous determination of pricing, production, and capacity investment decisions by a monopolistic firm in a multi‐period setting under demand uncertainty. We analyze the optimal decision with particular emphasis on the relationship between price and capacity. We consider models that allow for either bi‐directional price changes or models with markdowns only, and in the latter case we prove that capacity and price are strategic substitutes.     

Replenishment Policies for Multi‐Product Stochastic Inventory Systems with Correlated Demand and Joint‐Replenishment Costs

This study analyzes optimal replenishment policies that minimize expected discounted cost of multi‐product stochastic inventory systems. The distinguishing feature of the multi‐product inventory system that we analyze is the existence of correlated demand and joint‐replenishment costs across multiple products. Our objective is to understand the structure of the optimal policy and use this structure to construct a heuristic method that can solve problems set in real‐world sizes/dimensions. Using an MDP formulation we first compute the optimal policy. The optimal policy can only be computed for problems with a small number of product types due to the curse of dimensionality. Hence, using the insight gained from the optimal policy, we propose a class of policies that captures the impact of demand correlation on the structure of the optimal policy. We call this class (s, c, d, S)‐policies, and also develop an algorithm to compute good policies in this class, for large multi‐product problems. Finally using an exhaustive set of computational examples we show that policies in this class very closely approximate the optimal policy and can outperform policies analyzed in prior literature which assume independent demand. We have also included examples that illustrate performance under the average cost objective.     

Dynamic Pricing and Demand Estimation for a Single Unique Asset*

We address the situation of a firm that needs to dispose of a large, expensive asset (e.g., car, machine tool, earth mover, turbine, house, airplane), with or without a given deadline (and either known or unknown to the buyer). If a deadline exists, the asset is salvaged at a known value which may be zero, or even negative if there is a disposal cost. The asset has a known holding cost and may also have an initial nominal (undiscounted) price. The question is how, if at all, the price should be discounted as time progresses to maximize the expected proceeds. We use a dynamic recursion where each decision stage can be optimized based on classic economic monopoly pricing theory with a demand intensity function estimated from sales data, and show that the model is well‐behaved in the sense that the optimal price and optimal expected revenue monotonically decline as the deadline approaches. We test the model by comparing its optimal price pattern to the official pricing policy practiced at a used‐car dealer. We then extend the model to situations where the buyer knows the seller's deadline and thus may alter his behavior as the deadline approaches.     

Managing Inventory with Cash Register Information: Sales Recorded but Not Demands

Inventory inaccuracy is common in many businesses. While retailers employ cash registers to enter incoming orders and outgoing sales, inaccuracy arises because they do not record invisible demand such as spoilage, damage, pilferage, or returns. This setting results in incomplete inventory and demand information. An important inventory control problem therefore is to maximize the total expected discounted profit under this setting. Allowing for dependence between demand and invisible demand, we obtain the associated dynamic programming equation with an infinite‐dimensional state space, and reduce it to a simpler form by employing the concept of unnormalized probability. We develop an analytical upper bound on the optimal profit as well as an iterative algorithm for an approximate solution of the problem. We compare profits of the iterative solution and the myopic solution, and then to the upper bound. We see that the iterative solution performs better than the myopic solution, and significantly so in many cases. Furthermore, it gives a profit not far from the upper bound, and is therefore close to optimal. Using our results, we also discuss meeting inventory service levels.     

Optimal Reserve Prices in Name‐Your‐Own‐Price Auctions with Bidding and Channel Options

Few papers have explored the optimal reserve prices in the name‐your‐own‐price (NYOP) channel with bidding options in a multiple channel environment. In this paper, we investigate a double‐bid business model in which the consumers can bid twice in the NYOP channel, and compare it with the single‐bid case. We also study the impact of adding a retailer‐own list‐price channel on the optimal reserve prices. This paper focuses on achieving some basic understanding on the potential gain of adding a second bid option to a single‐bid system and on the potential benefits of adding a list‐price channel by the NYOP retailer. We show that a double‐bid scenario can outperform a single‐bid scenario in both single‐channel and dual‐channel situations. The optimal reserve price in the double‐bid scenario is no less than that in the single‐bid case. Furthermore, the addition of a retailer‐own list‐price channel could push up the reserve prices in both single‐bid and double‐bid scenarios.     

Supply Diversification with Responsive Pricing

We study sourcing and pricing decisions of a firm with correlated suppliers and a price‐dependent demand. With two suppliers, the insight—cost is the order qualifier while reliability is the order winner—derived in the literature for the case of exogenously determined price and independent suppliers, continues to hold when the suppliers' capacities are correlated. Moreover, a firm orders only from one supplier if the effective purchase cost from him, which includes the imputed cost of his unreliability, is lower than the wholesale price charged by his rival. Otherwise, the firm orders from both. Furthermore, the firm's diversification decision does not depend on the correlation between the two suppliers' random capacities. However, its order quantities do depend on the capacity correlation, and, if the firm's objective function is unimodal, the total order quantity decreases as the capacity correlation increases in the sense of the supermodular order. With more than two suppliers, the insight no longer holds. That is, when ordering from two or more suppliers, one is the lowest‐cost supplier and the others are not selected on the basis of their costs. We conclude the paper by developing a solution algorithm for the firm's optimal diversification problem.     

Optimal Policies for a Two‐Product Inventory System under a Flexible Substitution Scheme

We study a two‐product inventory model that allows substitution. Both products can be used to supply demand over a selling season of N periods, with a one‐time replenishment opportunity at the beginning of the season. A substitution could be offered even when the demanded product is available. The substitution rule is flexible in the sense that the seller can choose whether or not to offer substitution and at what price or discount level, and the customer may or may not accept the offer, with the acceptance probability being a decreasing function of the substitution price. The decisions are the replenishment quantities at the beginning of the season, and the dynamic substitution‐pricing policy in each period of the season. Using a stochastic dynamic programming approach, we present a complete solution to the problem. Furthermore, we show that the objective function is concave and submodular in the inventory levels—structural properties that facilitate the solution procedure and help identify threshold policies for the optimal substitution/pricing decisions. Finally, with a state transformation, we also show that the objective function is ‐concave, which allows us to derive similar structural properties of the optimal policy for multiple‐season problems.     

Revenue Management of Reusable Resources with Advanced Reservations

We consider a revenue management problem wherein the seller is endowed with a single type resource with a finite capacity and the resource can be repeatedly used to serve customers. There are multiple classes of customers arriving according to a multi‐class Poisson process. Each customer, upon arrival, submits a service request that specifies his service start time and end time. Our model allows customer advanced reservation times and services times in each class to be arbitrarily distributed and correlated. Upon arrival of each customer, the seller must instantaneously decide whether to accept this customer's service request. A customer whose request is denied leaves the system. A customer whose request is accepted is allocated with a specific item of the resource at his service start time. The resource unit occupied by a customer becomes available to other customers after serving this customer. The seller aims to design an admission control policy that maximizes her expected long‐run average revenue. We propose a policy called the ε‐perturbation class selection policy (ε‐CSP), based on the optimal solution in the fluid setting wherein customers are infinitesimal and customer arrival processes are deterministic, under the restriction that the seller can utilize at most (1 − ε) of her capacity for any ε ∈ (0, 1). We prove that the ε‐CSP is near‐optimal. More precisely, we develop an upper bound of the performance loss of the ε‐CSP relative to the seller's optimal revenue, and show that it converges to zero with a square‐root convergence rate in the asymptotic regime wherein the arrival rates and the capacity grow up proportionally and the capacity buffer level ε decays to zero.     

Coping with Gray Markets: The Impact of Market Conditions and Product Characteristics

Gray markets, also known as parallel imports, have created fierce competition for manufacturers in many industries. We analyze the impact of parallel importation on a price‐setting manufacturer that serves two markets with uncertain demand, and characterize her policy against parallel importation. We show that ignoring demand uncertainty can take a significant toll on the manufacturer's profit, highlighting the value of making price and quantity decisions jointly. We find that adjusting prices is more effective in controlling gray market activity than reducing product availability, and that parallel importation forces the manufacturer to reduce her price gap while demand uncertainty forces her to lower prices. Furthermore, we explore the impact of market conditions (such as market base, price sensitivity, and demand uncertainty) and product characteristics (“fashion” vs. “commodity”) on the manufacturer's policy towards parallel importation. We also provide managerial insights about the value of strategic decision‐making by comparing the optimal policy to the uniform pricing policy that has been adopted by some companies to eliminate gray markets entirely. The comparison indicates that the value of making price and quantity decisions strategically is highest for moderately different market conditions and non‐commodity products.     

Joint Inventory and Pricing Coordination with Incomplete Demand Information

In retailing operations, retailers face the challenge of incomplete demand information. We develop a new concept named K‐approximate convexity, which is shown to be a generalization of K‐convexity, to address this challenge. This idea is applied to obtain a base‐stock list‐price policy for the joint inventory and pricing control problem with incomplete demand information and even non‐concave revenue function. A worst‐case performance bound of the policy is established. In a numerical study where demand is driven from real sales data, we find that the average gap between the profits of our proposed policy and the optimal policy is 0.27%, and the maximum gap is 4.6%.     

The Affiliation Effect in First‐Price Auctions

We study the monotonicity of the equilibrium bid with respect to the number of bidders n in affiliated private‐value models of first‐price sealed‐bid auctions and prove the existence of a large class of such models in which the equilibrium bid function is not increasing in n. We moreover decompose the effect of a change in n on the bid level into a competition effect and an affiliation effect. The latter suggests to the winner of the auction that competition is less intense than she had thought before the auction. Since the affiliation effect can occur in both private‐ and common‐value models, a negative relationship between the bid level and n does not allow one to distinguish between the two models and is also not necessarily (only) due to bidders taking account of the winner's curse.     

An Entropy‐Based Methodology for Valuation of Demand Uncertainty Reduction

We propose a distribution‐free entropy‐based methodology to calculate the expected value of an uncertainty reduction effort and present our results within the context of reducing demand uncertainty. In contrast to existing techniques, the methodology does not require a priori assumptions regarding the underlying demand distribution, does not require sampled observations to be the mechanism by which uncertainty is reduced, and provides an expectation of information value as opposed to an upper bound. In our methodology, a decision maker uses his existing knowledge combined with the maximum entropy principle to model both his present and potential future states of uncertainty as probability densities over all possible demand distributions. Modeling uncertainty in this way provides for a theoretically justified and intuitively satisfying method of valuing an uncertainty reduction effort without knowing the information to be revealed. We demonstrate the methodology's use in three different settings: (i) a newsvendor valuing knowledge of expected demand, (ii) a short life cycle product supply manager considering the adoption of a quick response strategy, and (iii) a revenue manager making a pricing decision with limited knowledge of the market potential for his product.     

Ranked Items Auctions and Online Advertisement

We study auctions for a set of commonly‐ranked items where each buyer has unit demand. This setting has promising applications in areas such as keyword auctions in the search engine advertising industry, the sale of quality‐ranked raw materials, etc. An auction mechanism suitable for this setting is the simultaneous pooled auction (SPA), where each bidder simultaneously submits a single bid and is allocated an object based on the rank of his bid among all the bids. We study how to improve the seller's expected revenue by enforcing a reserve price in an SPA. We find that the use of an appropriate reserve price may significantly increase the seller's revenue, especially when the number of items for sale is relatively large compared to the number of participating bidders. One inherent problem in the SPA is that some bidders may incur ex post losses; that is, they pay more than what they value the received objects. We propose a tailored VCG mechanism that generates the same expected revenue as the SPA does, while bidders do not incur any ex post loss. We also discuss the potential applications of this research to keyword auctions.     

固定价格与英式拍卖同时使用时顾客行为分析

很多网站采用在英式拍卖中加入固定价格选项的方式销售多件同类商品.我们证明了,在此规则下存在一个弱占优投标策略.若顾客对商品的估价低于固定价格,那么,当拍卖价格低于他的估价时,该顾客参与拍卖,且以自己的估价作为报价是他的弱占优投标策略;否则,当拍卖价格超过他的估价时,他退出拍卖.若顾客对商品的估价高于或等于固定价格,他会在参与拍卖和接受固定价格之间进行选择;若他参与拍卖,将固定价格作为报价是他的弱占优投标策略.我们发现,该顾客是选择参与拍卖、还是选择以固定价格购买主要依赖于顾客到达拍卖时距离拍卖结束的剩余时间.最后,通过算例,我们对影响顾客参与策略的因素进行了数值分析并得到了一些结论.     

Tractable Consideration Set Structures for Assortment Optimization and Network Revenue Management

Discrete‐choice models are widely used to model consumer purchase behavior in assortment optimization and revenue management. In many applications, each customer segment is associated with a consideration set that represents the set of products that customers in this segment consider for purchase. The firm has to make a decision on what assortment to offer at each point in time without the ability to identify the customer's segment. A linear program called the Choice‐based Deterministic Linear Program (CDLP) has been proposed to determine these offer sets. Unfortunately, its size grows exponentially in the number of products and it is NP‐hard to solve when the consideration sets of the segments overlap. The Segment‐based Deterministic Concave Program with some additional consistency equalities (SDCP+) is an approximation of CDLP that provides an upper bound on CDLP's optimal objective value. SDCP+ can be solved in a fraction of the time required to solve CDLP and often achieves the same optimal objective value. This raises the question under what conditions can one guarantee equivalence of CDLP and SDCP+. In this study, we obtain a structural result to this end, namely that if the segment consideration sets overlap with a certain tree structure or if they are fully nested, CDLP can be equivalently replaced with SDCP+. We give a number of examples from the literature where this tree structure arises naturally in modeling customer behavior.     

Optimal Policies for Selling New and Remanufactured Products

Because of environmental and economic reasons, an increasing number of original equipment manufacturers (OEMs) nowadays sell both new and remanufactured products. When both products are available, customers will buy the one that gives them a higher (and non‐negative) utility. Thus, if the firm does not price the products properly, then product cannibalization may arise and its revenue may be adversely impacted. In this paper, we study the pricing problem of a firm that sells both new and remanufactured products over a finite planning horizon. Customer demand processes for both new and remanufactured products are random and price‐sensitive, and product returns (also called cores) are random and remanufactured upon receipt. We characterize the optimal pricing and manufacturing policies that maximize the expected total discounted profit. If new products are made‐to‐order (MTO), we show that when the inventory level of remanufactured product increases, the optimal price of remanufactured product decreases while the price difference between new and remanufactured products increases; however, the optimal selling price of new product may increase or decrease. If new products are made to stock (MTS), then the optimal manufacturing policy is of a base‐stock policy with the base‐stock level decreasing in the remanufactured product inventory level. To understand the potential benefit in implementing an MTO system, we study the difference between the value functions of the MTO and MTS systems, and develop lower and upper bounds for it. Finally, we study several extensions of the base model and show that most of our results extend to those more general settings.