{"title":"Pricing a product with network effects for sale to a fixed population of customers","authors":"Tongqing Chen, William L. Cooper","doi":"10.1002/nav.22219","DOIUrl":null,"url":null,"abstract":"We consider a deterministic dynamic pricing problem for a product that exhibits network effects and that is sold to a fixed heterogeneous population of customers. We begin by introducing a demand model wherein those customers are arrayed over two‐dimensional space according to a bivariate probability distribution. Each customer's location in space provides a description of that customer's intrinsic value for the product as well as the extent to which the customer is influenced by the network effect. In the pricing problem, as sales accumulate over time, the set of customers who have already purchased the product grows, while the set of customers who have not yet purchased the product shrinks. The total customer population remains fixed. Those who have not yet purchased constitute the remaining population of potential buyers of the product. As time moves forward, the mix of customers that remain as potential buyers evolves endogenously. The demand model yields a geometric interpretation of the remaining population of potential buyers, and gives rise to a dynamic program with states that are sets in two‐dimensional space. It is not practical to solve the dynamic pricing problem to optimality, so we present bounds and comparative statics results that help us identify tractable heuristics and obtain rigorous performance guarantees. In numerical experiments, we find that fixed‐price policies may perform poorly, especially when the network effect is strong or the time horizon is long. We also introduce a stochastic version of the problem that uses a spatial Poisson process to describe the customers, and we develop and analyze a heuristic approach for that formulation.","PeriodicalId":49772,"journal":{"name":"Naval Research Logistics","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1002/nav.22219","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
We consider a deterministic dynamic pricing problem for a product that exhibits network effects and that is sold to a fixed heterogeneous population of customers. We begin by introducing a demand model wherein those customers are arrayed over two‐dimensional space according to a bivariate probability distribution. Each customer's location in space provides a description of that customer's intrinsic value for the product as well as the extent to which the customer is influenced by the network effect. In the pricing problem, as sales accumulate over time, the set of customers who have already purchased the product grows, while the set of customers who have not yet purchased the product shrinks. The total customer population remains fixed. Those who have not yet purchased constitute the remaining population of potential buyers of the product. As time moves forward, the mix of customers that remain as potential buyers evolves endogenously. The demand model yields a geometric interpretation of the remaining population of potential buyers, and gives rise to a dynamic program with states that are sets in two‐dimensional space. It is not practical to solve the dynamic pricing problem to optimality, so we present bounds and comparative statics results that help us identify tractable heuristics and obtain rigorous performance guarantees. In numerical experiments, we find that fixed‐price policies may perform poorly, especially when the network effect is strong or the time horizon is long. We also introduce a stochastic version of the problem that uses a spatial Poisson process to describe the customers, and we develop and analyze a heuristic approach for that formulation.
期刊介绍:
Submissions that are most appropriate for NRL are papers addressing modeling and analysis of problems motivated by real-world applications; major methodological advances in operations research and applied statistics; and expository or survey pieces of lasting value. Areas represented include (but are not limited to) probability, statistics, simulation, optimization, game theory, quality, scheduling, reliability, maintenance, supply chain, decision analysis, and combat models. Special issues devoted to a single topic are published occasionally, and proposals for special issues are welcomed by the Editorial Board.