基于异质性顾客心理期望等待时间的优先权服务定价研究

本文以非抢占式M/M/1排队系统为背景,以企业收益最大化为目标,基于顾客异质性(单位时间等待成本不同)将顾客分为两类,针对顾客的心理期望等待时间对服务提供商最优定价策略的影响进行研究。首先研究优先权顾客心理期望等待时间对企业收益的影响以及相应的优先权定价,然后研究优先权顾客和普通顾客同时存在心理期望等待时间对企业收益的影响和相应的优先权定价。研究表明:仅考虑优先权顾客的心理期望等待时间,企业应通过提高优先权定价来获得最优收益;当优先权顾客和普通顾客同时存在心理期望等待时间时,企业仍然采取提高优先权定价的策略,若普通顾客的价值大(获取服务的基本费用大),企业应对普通顾客提供一定的折扣来消除其心理期望等待时间增加企业收益;如果普通顾客的价值较小,企业应"有意"流失部分普通顾客,吸引更多顾客到优先权队列获取服务来获得更多收益。本文研究对于服务提供商在考虑顾客心理期望等待时间基础上设置最合理的队列机制有一定的指导意义和实际应用价值。     

基于顾客心理期望等待时间的服务策略研究

顾客在排队系统获取服务时，会存在心理上的期望等待时间，该期望会影响顾客在排队系统中的行为变化和流动，从而影响企业收益。本文以传统的M/M/1排队系统为背景，基于顾客存在期望等待时间的前提下，以企业收益最大化为优化目标进行研究。首先，对相应基础理论和模型假设进行介绍；其次，对顾客存在心理期望等待时间情形提出三种新的策略：重新定价、通过折扣对顾客期望值进行调整、提高服务率；然后，分别对上述三种策略进行优化分析，并同现有结果进行比较；研究表明：三种策略都比维持原有定价带来更大收益；当折扣力度较小时或顾客对费用感知强于时间感知时，折扣策略优于重新定价策略；当折扣力度较大或顾客对时间感知强于费用感知时，重新定价策略优于折扣策略；最后，通过对最优结果分析提出相应管理启示。本文的研究对于顾客存在心理期望等待时间的服务定价具有重要的指导意义和实际应用价值。     

Strategic Capacity Management When Customers Have Boundedly Rational Expectations

In retailing industries, such as apparel, sporting goods, customer electronics, and appliances, many firms deploy sophisticated modeling and optimization software to conduct dynamic pricing in response to uncertain and fluctuating market conditions. However, the possibility of markdown pricing creates an incentive for customers to strategize over the timing of their purchases. How should a retailing firm optimally account for customer behavior when making its pricing and stocking/capacity decisions? For example, is it optimal for a firm to create rationing risk by deliberately under stocking products? In this study, we develop a stylized modeling framework to answer these questions. In our model, customers strategize over the timing of their purchases. However, customers have boundedly rational expectations in the sense of anecdotal reasoning about the firm's fill rate, i.e., they have to rely on anecdotes, past experiences, or word‐of‐mouth to infer the firm's fill rate. In our modeling framework, we distinguish two settings: (i) capacity commitment, where the firm commits to its capacity level in the long run, or (ii) the firm dynamically changes it in each season. For both settings, within the simplest form of anecdotal reasoning, we prove that strategic capacity rationing is not optimal independent of customer risk preferences. Then, using a general form of anecdotal reasoning, we provide sufficient conditions for capacity rationing to be optimal for both settings, respectively. We show that the result of strategic capacity rationing being suboptimal is fairly robust to different valuation distributions and utility functions, heterogeneous sample size, and price optimization.     

Quality‐Speed Competition in Customer‐Intensive Services with Boundedly Rational Customers

We consider a system in which two competing servers provide customer‐intensive services and the service reward is affected by the length of service time. The customers are boundedly rational and choose their service providers according to a logit model. We demonstrate that the service provider revenue function is unimodal in the service rate, its decision variable, and show that the service rate competition has a unique and stable equilibrium. We then study the price decision under three scenarios with the price determined by a revenue‐maximizing firm, a welfare‐maximizing social planner, or two servers in competition. We find that the socially optimal price, subject to the requirement that the customer actual utility must be non‐negative, is always lower than the competition equilibrium price which, in turn, is lower than the revenue‐maximizing monopoly price. However, if the customer actual utility is allowed to be negative in social optimization, the socially optimal price can be higher than the other two prices in a large market.     

Pricing and Operational Performance in Discretionary Services

In many services, for example, website or landscape design, the value or quality derived by a customer depends upon the service time, and this valuation differs across customers. Customers procure the service based on the expected value to be delivered, prices charged, and the timeliness of service. We investigate the performance of the optimal pricing scheme as well as two commonly used pricing schemes (fixed fee and time‐based pricing) for such services on important dimensions such as revenue, demand served, and utilization. We propose a novel model that captures the above features and wherein both service rate and demand are endogenous and functions of the pricing scheme. In particular, service time is an outcome of the pricing scheme adopted and the heterogeneous valuations of customers, unlike in the queueing‐based pricing literature. We find that the service system may benefit from a greater variance in consumer valuations, and the performance of pricing schemes is impacted by the shape of the distribution of customers' valuation of service time and the responsiveness desired by customers. Both the fixed fee and time‐based schemes do well relative to the optimal pricing scheme in terms of revenue in many plausible scenarios, but there are substantial differences between the pricing schemes in some important operational metrics. For instance, the fixed fee scheme serves more customers and has higher utilization than the time‐based scheme. We also explore variants of the fixed and time‐based schemes that have better revenue performance and show that the two‐part tariff which is a combination of fixed and time‐based pricing can do as well as the optimal scheme in terms of revenue.     

The Impact of Revenue‐Maximizing Priority Pricing on Customer Delay Costs

Speed is an increasingly important determinant of which suppliers will be given customers' business and is defined as the time between when an order is placed by the customer and when the product is delivered, or as the amount of time customers must wait before they receive their desired service. In either case, the speed a customer experiences can be enhanced by giving priority to that particular customer. Such a prioritization scheme will necessarily reduce the speed experienced by lower‐priority customers, but this can lead to a better outcome when different customers place different values on speed. We model a single resource (e.g., a manufacturer) that processes jobs from customers who have heterogeneous waiting costs. We analyze the price that maximizes priority revenue for the resource owner (i.e., supplier, manufacturer) under different assumptions regarding customer behavior. We discover that a revenue‐maximizing supplier facing self‐interested customers (i.e., those that independently minimize their own expected costs) charges a price that also minimizes the expected total delay costs across all customers and that this outcome does not result when customers coordinate to submit priority orders at a level that seeks to minimize their aggregate costs of priority fees and delays. Thus, the customers are better off collectively (as is the supplier) when the supplier and customers act independently in their own best interests. Finally, as the number of priority classes increases, both the priority revenues and the overall customer delay costs improve, but at a decreasing rate.     

基于顾客公平偏好的服务机制与定价研究

由于顾客异质性（单位时间等待成本不同），服务提供商通常对顾客采取分类服务策略，然而分类服务会引起服务系统中不同类型顾客之间等待时间和服务价值的差异性，从而给顾客带来心理上的不公平感，进而引起顾客在服务系统中的流动和转移，进一步影响企业收益和社会福利。本文针对非抢占M/M/1服务系统顾客分类情形为背景，由两种顾客之间期望等待时间的不同和公平偏好参数相结合构建普通顾客的公平心理效用模型，以垄断型服务系统为背景，分别从企业收益、社会福利与顾客效用三个视角进行分析。研究表明，服务提供商应对顾客采取可观测型的分类服务机制来获得最大收益；从社会福利视角，服务提供商应对顾客采取不可观测型的分类服务机制；从顾客效用视角，服务提供商应取消顾客分类服务，仅保留普通顾客。最后同现有结论进行比较分析，并进行拓展研究。本文研究对服务提供商采取合理的服务机制及相应的服务定价具有重要参考价值和指导意义。     

Pricing of Full‐Service Repair Contracts with Learning,Optimized Maintenance,and Information Asymmetry

This article considers the optimal pricing of full‐service (FS) repair contracts by taking into account learning and maintenance efficiency effects, competition from service , and asymmetric information. We analyze on‐call service (OS) and FS contracts in a market where customers exhibit heterogeneous risk aversion. While the customers minimize their disutility over the equipment lifetime, the service provider maximizes expected profits arising from the portfolio of OS and FS contracts. We show that the optimal FS price depends inter alia on the customer's prior cost experience and on OS repair and maintenance costs. The optimal FS price is shown to increase as fewer OS customers are lost to competition, whereas improved repair learning enabled by FS reduces the optimal price. A numerical study based on data from a manufacturer of forklifts highlights the importance of learning in maintenance operations, which constitutes the key benefit of FS contracts; 81% of the customers select the FS option and are willing to pay an insurance premium of around 1.5% of total OS cost against volatility of repair costs.     

基于顾客不公平规避的服务定价研究

设计合理的服务机制和定价策略对于企业运营至关重要。由于顾客异质性（等待时间成本不同）企业通常对顾客进行分类服务,然而分类服务会引发顾客的不公平心理,并带来负效用,从而引起顾客流动与转移,进而影响企业收益与社会成本。本文针对垄断型服务系统中,顾客不公平规避心理（用参数α表示）对于企业优化目标的影响进行分析,在此基础之上,研究企业是否对顾客采取分类服务以及如何合理定价。结果表明,当顾客不公平规避偏好心理较弱时,从社会成本最小化和企业收益最大化的角度都应该对顾客进行分类服务并收取优先服务费用。当顾客不公规避心理较强时,从企业收益最大化的角度应仅保留优先权顾客并收取优先服务费用,从社会成本最小化的角度则应取消优先服务费用仅保留普通顾客。最后,通过数值模拟和理论分析对上述结论进行验证。     

考虑战略顾客行为时的供应链性能分析与协调

动态定价策略的广泛应用使得越来越多的顾客具有了战略性,战略顾客会根据产品在销售期内的价格路径确定最优购买时机,零售商则根据顾客的购买行为确定订货数量和销售价格.研究了双方静态博弈时的理性预期均衡解和零售商进行数量承诺时的情形.研究表明:理性预期均衡时的最优销售价格、最优存货数量和最优期望利润分别小于标准报童模型的情形;数量承诺时的最优存货数量小于理性预期均衡时的最优存货数量;最优期望利润则大于理性预期均衡时的最优期望利润,并且在一定条件下可能会大于标准报童模型的最优期望利润,战略顾客行为的存在对零售商可能有利.最后分析了在分散式供应链中如何利用收入分享契约和数量折扣契约实现供应链协调.     

A Choice‐Based Dynamic Programming Approach for Setting Opaque Prices

Opaque pricing is a form of pricing where certain characteristics of the product or service are hidden from the consumer until after purchase. In essence, opaque selling transforms a differentiated good into a commodity. Opaque pricing has become popular in service pricing as it allows firms to sell their differentiated product at higher prices to regular brand loyal customers while simultaneously selling to non‐brand loyal customers at discounted prices. We use a nested logit model in combination with logistic regression and dynamic programming to illustrate how a service firm can optimally set prices on an opaque sales channel. The choice model allows the characterization of consumer trade‐offs when purchasing opaque products while the dynamic programming approach allows the characterization of the optimal pricing policy as a function of inventory and time remaining. We compare optimal prices and expected revenues when dynamic pricing is restricted to daily price changes. We provide an illustrative example using data from an opaque selling mechanism ( Hotwire.com ) and a Washington DC‐based hotel.     

Static and Dynamic Pricing of Excess Capacity in a Make‐to‐Order Environment

We consider a make‐to‐order manufacturer that serves two customer classes: core customers who pay a fixed negotiated price, and “fill‐in” customers who make submittal decisions based on the current price set by the firm. Using a Markovian queueing model, we determine how much the firm can gain by explicitly accounting for the status of its production facility in making pricing decisions. Specifically, we examine three pricing policies: (1) static, state‐independent pricing, (2) constant pricing up to a cutoff state, and (3) general state‐dependent pricing. We determine properties of each policy, and illustrate numerically the financial gains that the firm can achieve by following each policy as compared with simpler policies. Our main result is that constant pricing up to a cutoff state can dramatically outperform a state‐independent policy, while at the same time achieving most of the increase in revenue achievable from general state‐dependent pricing. Thus, we find that constant pricing up to a cutoff state presents an attractive tradeoff between ease of implementation and revenue gain. When the costs of policy design and implementation are taken into account, this simple heuristic may actually out‐perform general state‐dependent pricing in some settings.     

TIME‐BASED PRICING AND LEADTIME POLICIES FOR A BUILD‐TO‐ORDER MANUFACTURER

We studied time‐based policies on pricing and leadtime for a build‐to‐order and direct sales manufacturer. It is assumed that the utility of the product varies among potential customers and decreases over time, and that a potential customer will place an order if his or her utility is higher than the manufacturer's posted price. Once an order is placed, it will be delivered to the customer after a length of time called “leadtime.” Because of the decrease in a customer's utility during leadtime, a customer will cancel the order if the utility falls below the ordering price before the order is received. The manufacturer may choose to offer discounted prices to customers who would otherwise cancel their orders. We discuss two price policies: common discounted price and customized discounted price. In the common discounted price policy, the manufacturer offers a single lower price to the customers; in the customized discounted price policy, the manufacturer offers the customers separately for individual new prices. Our analytical and numerical studies show that the discounted price policies results in higher revenue and that the customized discounted price policy significantly outperforms the common discounted price policy when product utility decreases rapidly. We also study two leadtime policies when production cost decreases over time. The first uses a fixed leadtime, and the second allows the leadtime to vary dynamically over time. We find that the dynamic leadtime policy significantly outperforms the fixed leadtime policy when the product cost decreases rapidly.     

Pareto‐Improving Contracts for Express Package Delivery Services

We address the problem of an express package delivery company in structuring a long‐term customer contract whose terms may include prices that differ by day‐of‐week and by speed‐of‐service. The company traditionally offered speed‐of‐service pricing to its customers, but without day‐of‐week differentiation, resulting in customer demands with considerable day‐of‐week seasonality. The package delivery company hoped that using day‐of‐week and speed‐of‐service price differentiation for contract customers would induce these customers to adjust their demands to become counter‐cyclical to the non‐contract demand. Although this usually cannot be achieved by pricing alone, we devise an approach that utilizes day‐of‐week and speed‐of‐service pricing as an element of a Pareto‐improving contract. The contract provides the lowest‐cost arrangement for the package delivery company while ensuring that the customer is at least as well off as he would have been under the existing pricing structure. The contract pricing smoothes the package delivery company's demand and reduces peak requirements for transport capacity. The latter helps to decrease capital costs, which may allow a further price reduction for the customer. We formulate the pricing problem as a biconvex optimization model, and present a methodology for designing the contract and numerical examples that illustrate the achievable savings.     

Optimal Uniform Pricing Strategy of a Service Firm When Facing Two Classes of Customers

When facing heterogeneous customers, how should a service firm make its pricing decision to maximize revenue? If discrimination is allowed, then priority schemes and differentiated pricing are often used to achieve that. In many applications, however, the firm cannot or is not allowed to set discriminatory prices, for example, list price in retail stores, online shopping, and gas stations; thus a uniform price must be applied to all customers. This study addresses the optimal uniform pricing problem of a service firm using a queueing system with two classes of customers. Our result shows that the potential pool of customers plays a central role in the firm's optimal decision. Depending on the range of system parameters, which are determined explicitly by the primitive data, the firm's optimal strategy may choose to serve only one class of customers, a subset of a class of customers, or a combination of different classes of customers. In addition, the optimal price is in general not monotonic with respect to the potential market sizes because their changes may lead to a major shift in the firm's decision on which customer class to serve. However, unless such a shift occurs, the optimal price is weakly decreasing in the potential market sizes.     

Skill Management in Large‐Scale Service Marketplaces

Large‐scale, web‐based service marketplaces have recently emerged as a new resource for customers who need quick resolutions for their short‐term problems. Due to the temporary nature of the relations between customers and service providers (agents) in these marketplaces, customers may not have an opportunity to assess the ability of an agent before their service completion. On the other hand, the moderating firm has a more sustained relationship with agents, and thus it can provide customers with more information about the abilities of agents through skill screening mechanisms. In this study, we consider a marketplace where the moderating firm can run two skills tests on agents to assess if their skills are above certain thresholds. Our main objective is to evaluate the effectiveness of skill screening as a revenue maximization tool. We, specifically, analyze how much benefit the firm obtains after each additional skill test. We find that skill screening leads to negligible revenue improvements in marketplaces where agent skills are highly compatible and the average service times are similar for all customers. As the compatibility of agent skills weakens or the customers start to vary in their processing time needs, we show that the firm starts to experience sizable improvements in revenue from skill screening. Apparently, the firm can reap the most of these substantial benefits when it runs only one test. For instance, in marketplaces where agents posses uncorrelated skills, the second skill test only brings an additional 2% improvement in revenue. Accounting for possible skill screening costs, we then show the optimality of offering only one test when the compatibility between agent skills is sufficiently low. The results of this study also have important implications in terms of the right level of intervention in the marketplaces we study.     

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.     

Profitability of Service‐Level‐Based Price Differentiation with Inventory Rationing

In this paper, we study the profitability of service‐level‐based price differentiation (SLBPD) in an inventory‐rationing context. SLBPD implies that a company offers several combinations of prices and guaranteed service levels, from which customers self‐select; different customers choose different offerings because they incur different shortage costs if an order is not fulfilled immediately. We develop an analytical model for SLBPD and explore if and when such a service differentiation strategy yields higher profits than a single undifferentiated offering. The results of our analyses suggest that SLBPD is profitable only if a company faces pricing restrictions, e.g., because of competitive pressure or regulatory restrictions. We develop necessary and sufficient conditions under which a specific and relevant form of SLBPD (called “service‐level‐based upselling”) is profitable, and provide an algorithm to compute the optimal parameters of such a policy. Based on this algorithm we carry out numerical analyses that allow us to characterize the profit increment of service‐level‐based upselling. We derive managerial insights into the attractiveness of SLBPD and explain how our basic analytical framework can be extended to account for more complex practical features.     

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.     

Pricing,Allocation, and Overbooking in Dynamic Service Network Competition When Demand Is Uncertain

We study the problem of combined pricing, resource allocation, and overbooking by service providers involved in dynamic noncooperative oligopolistic competition on a network that represents the relationships of the providers to one another and to their customers when service demand is uncertain. We propose, analyze, and compute solutions for a model that is more general than other models reported in the revenue management literature to date. In particular, previous models typically consider only three or four of five key revenue management features that we have purposely built into our model: (1) pricing, (2) resource allocation, (3) dynamic competition, (4) an explicit network, and (5) uncertain demand. Illustrative realizations of the abstract problem we study are those of airline revenue management and service provision by companies facing resource constraints. Under fairly general regularity conditions, we prove existence and uniqueness of a pure strategy Nash equilibrium for dynamic oligopolistic service network competition described by our model. We also show, for an appropriate notion of regularity, that competition leads to the underpricing of network services, a finding numerically illustrated by an example of intermediate size. Our proposed algorithm can be implemented using well‐known off‐the‐shelf commercial software.