Pricing and capacity allocation for shared services

Kostami, V, Kostamis, D and Ziya, S (2017) Pricing and capacity allocation for shared services. Manufacturing & Service Operations Management (MOSM), 19 (2). pp. 230-245. ISSN 1526-5498 OPEN ACCESS

Abstract

We study the pricing and capacity allocation problem of a service provider who serves two distinct customer classes. Customers within each class are inherently heterogeneous in their willingness to pay for service, but their utilities are also affected by the presence of other customers in the system. Specifically, customer utilities depend on how many customers are in the system at the time of service as well as who these other customers are. We find that if the service provider can price discriminate between customer classes, pricing out a class, i.e., operating an exclusive system, can sometimes be optimal and that depends only on classes’ perceptions of each other. If the provider must charge a single price, an exclusive system is even more likely. We extend our analysis to a service provider who can prevent class interaction by allocating separate capacity segments to the two customer classes. Under price discrimination, allocating capacity is optimal if the “net appreciation” between classes, as defined in the paper, is negative. However, under a single–price policy, allocating capacity can be optimal even if this net appreciation is positive. We describe in detail how the nature of asymmetry in classes’ perception of each other determines the optimal strategy.

More Details

Item Type: Article
Subject Areas: Management Science and Operations
Additional Information: © 2016 INFORMS
Subjects: P > Pricing
C > Capacity management
Date Deposited: 20 Oct 2016 15:23
Last Modified: 16 Sep 2019 09:44
URI: http://lbsresearch.london.edu/id/eprint/582
More

Export and Share


Download

Accepted Version - Text

Statistics

Altmetrics
View details on Dimensions' website

Downloads from LBS Research Online

View details

Actions (login required)

Edit Item Edit Item