skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Optimal Pricing and Introduction Timing of Technology Upgrades in Subscription-Based Services
In the context of subscription-based services, many technologies improve over time, and service providers can provide increasingly powerful service upgrades to their customers but at a launching cost and the expense of the sales of existing products. We propose a model of technology upgrades and characterize the optimal pricing and timing of technology introductions for a service provider who price-discriminates among customers based on their upgrade experience in the face of customers who are averse to switching to improved offerings. We first characterize optimal discriminatory pricing for the infinite horizon pricing problem with fixed introduction times. We reduce the optimal pricing problem to a tractable optimization problem and propose an efficient algorithm for solving it. Our algorithm computes optimal discriminatory prices within a fraction of a second even for large problem instances. We then show that periodic introduction times, combined with optimal pricing, enjoy optimality guarantees. In particular, we first show that, as long as the introduction intervals are constrained to be nonincreasing, it is optimal to have periodic introductions after an initial warm-up phase. When allowing general introduction intervals, we show that periodic introduction intervals after some time are optimal in a more restricted sense. Numerical experiments suggest that it is generally optimal to have periodic introductions after an initial warm-up phase. Finally, we focus on a setting in which the firm does not price-discriminate based on customers’ experience. We show both analytically and numerically that in the nondiscriminatory setting, a simple policy of Myerson (i.e., myopic) pricing and periodic introductions enjoys good performance guarantees. Funding: This material is based upon work supported by INSEAD and University Pierre et Marie Curie [Grant ELICIT], as well as by the National Science Foundation [Grant 2110707]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2022.2364 .  more » « less
Award ID(s):
2110707
PAR ID:
10440094
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Operations Research
Volume:
71
Issue:
2
ISSN:
0030-364X
Page Range / eLocation ID:
665 to 687
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Management Science)
    null (Ed.)
    We study the power of selling opaque products, that is, products where a feature (such as color) is hidden from the customer until after purchase. Opaque products, which are sold with a price discount, have emerged as a powerful vehicle to increase revenue for many online retailers and service providers that offer horizontally differentiated items. In the opaque selling models we consider, all of the items are sold at a single common price alongside opaque products that may correspond to various subsets of the items. We consider two types of customers, risk-neutral ones, who assume they will receive a truly random item of the opaque product, and pessimistic ones, who assume they will receive their least favorite item of the opaque product. We benchmark opaque selling against two common selling strategies: discriminatory pricing, where one explicitly charges different prices for each item, and single pricing, where a single price is charged for all the items. We give a sharp characterization of when opaque selling outperforms discriminatory pricing; namely, this result holds for situations where all customers are pessimistic or the item valuations are supported on two points. In the latter case, we also show that opaque selling with just one opaque product guarantees at least 71.9% of the revenue from discriminatory pricing. We then provide upper bounds on the potential revenue increase from opaque selling strategies over single pricing and describe cases where the increase can be significantly more than that of discriminatory pricing. Finally, we provide pricing algorithms and conduct an extensive numerical study to assess the power of opaque selling for a variety valuation distributions and model extensions. This paper was accepted by Gabriel Weintraub, revenue management and market analytics. 
    more » « less
  2. ; ; (, Proceedings of the IISE Annual Conference & Expo 2025)
    Gentry, E; Ju, F; Liu, X (Ed.)
    This research investigates optimal pricing strategies in a service-providing queueing system where customers may renege before service completion. Prices are quoted upon customer arrivals and the incoming customers join the system if their willingness to pay exceeds the quoted price. While waiting in line or during service, customers may get impatient and leave without service, incurring an abandonment cost. There is also a per-unit time per-customer holding cost. Our objective is to maximize the long-run average profit through optimal pricing policies. We model the problem as a Markov decision process and identify the optimal pricing using policy iteration. We also study the structure of the optimal pricing policy. Furthermore, we show that under mild assumptions, the optimal price increases as the number of customers in the system increases. When those assumptions do not hold, optimal price decreases and then increases as the number of customers in the system grows. 
    more » « less
  3. ; ; (, Proceedings of the IISE Annual Conference & Expo 2025)
    Gentry, E; Ju, F; Liu, X (Ed.)
    This research investigates optimal pricing strategies in a service-providing queueing system where customers may renege before service completion. Prices are quoted upon customer arrivals and the incoming customers join the system if their willingness to pay exceeds the quoted price. While waiting in line or during service, customers may get impatient and leave without service, incurring an abandonment cost. There is also a per-unit time per-customer holding cost. Our objective is to maximize the long-run average profit through optimal pricing policies. We model the problem as a Markov decision process and identify the optimal pricing using policy iteration. We also study the structure of the optimal pricing policy. Furthermore, we show that under mild assumptions, the optimal price increases as the number of customers in the system increases. When those assumptions do not hold, optimal price decreases and then increases as the number of customers in the system grows. 
    more » « less
  4. ; ; (, Operations Research)
    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. ; ; ; ; (, Journal of Cloud Computing)
    Abstract In current infrastructure-as-a service (IaaS) cloud services, customers are charged for the usage of computing/storage resources only, but not the network resource. The difficulty lies in the fact that it is nontrivial to allocate network resource to individual customers effectively, especially for short-lived flows, in terms of both performance and cost, due to highly dynamic environments by flows generated by all customers. To tackle this challenge, in this paper, we propose an end-to-end Price-Aware Congestion Control Protocol (PACCP) for cloud services. PACCP is a network utility maximization (NUM) based optimal congestion control protocol. It supports three different classes of services (CoSes), i.e., best effort service (BE), differentiated service (DS), and minimum rate guaranteed (MRG) service. In PACCP, the desired CoS or rate allocation for a given flow is enabled by properly setting a pair of control parameters, i.e., a minimum guaranteed rate and a utility weight, which in turn, determines the price paid by the user of the flow. Two pricing models, i.e., a coarse-grained VM-Based Pricing model (VBP) and a fine-grained Flow-Based Pricing model (FBP), are proposed. The optimality of PACCP is verified by both large scale simulation and small testbed implementation. The price-performance consistency of PACCP are evaluated using real datacenter workloads. The results demonstrate that PACCP provides minimum rate guarantee, high bandwidth utilization and fair rate allocation, commensurate with the pricing models. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email