A Nonparametric Approach to Multiproduct Pricing

Developed by General Motors (GM), the Auto Choice Advisor website (http://www.autochoiceadvisor.com) recommends vehicles to consumers based on their requirements and budget constraints. Through the website, GM has access to large quantities of data that reflect consumer preferences. Motivated by the availability of such data, we formulate a nonparametric approach to multiproduct pricing. We consider a class of models of consumer purchasing behavior, each of which relates observed data on a consumers requirements and budget constraint to subsequent purchasing tendencies. To price products, we aim at optimizing prices with respect to a sample of consumer data. We offer a bound on the sample size required for the resulting prices to be near-optimal with respect to the true distribution of consumers. The bound exhibits a dependence of O(n log n) on the number n of products being priced, showing thatin terms of sample complexitythe approach is scalable to large numbers of products. With regards to computational complexity, we establish that computing optimal prices with respect to a sample of consumer data is NP-complete in the strong sense. However, when prices are constrained by a price ladderan ordering of prices defined prior to price determinationthe problem becomes one of maximizing a supermodular function with real-valued variables. It is not yet known whether this problem is NP-hard. We provide a heuristic for our price-ladder-constrained problem, together with encouraging computational results. Finally, we apply our approach to a data set from the Auto Choice Advisor website. Our analysis provides insights into the current pricing policy at GM and suggests enhancements that may lead to a more effective pricing strategy.

[1]  J. Lamperti.  ON CONVERGENCE OF STOCHASTIC PROCESSES , 1962 .

[2]  F. Livesey.  Product-Line Pricing , 1976 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Allan D. Shocker,et al.  Multiattribute Approaches for Product Concept Evaluation and Generation: A Critical Review , 1979 .

[5]  Leonard J. Mirman,et al.  Optimal Nonlinear Prices for Multiproduct Monopolies , 1980 .

[6]  M. Spence.  Multi-product quantity-dependent prices and profitability constraints , 1980 .

[7]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[8]  S. Oren,et al.  Pricing a Product Line , 1984 .

[9]  Paul E. Green,et al.  Models and Heuristics for Product Line Selection , 1985 .

[10]  Stephen A. Smith.  New Product Pricing in Quality Sensitive Markets , 1986 .

[11]  S. Oren,et al.  Multi-product pricing for electric power , 1987 .

[12]  Fred S. Zufryden,et al.  An Integer Programming Approach to the Optimal Product Line Selection Problem , 1988 .

[13]  Gregory Dobson,et al.  Positioning and Pricing a Product Line , 1988 .

[14]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[15]  Ward Hanson,et al.  Optimal bundle pricing , 1990 .

[16]  Samuel E. Bodily,et al.  A Taxonomy and Research Overview of Perishable-Asset Revenue Management: Yield Management, Overbooking, and Pricing , 1992, Oper. Res..

[17]  David Haussler,et al.  Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications , 1992, Inf. Comput..

[18]  G. Dobson,et al.  Heuristics for pricing and positioning a product-line using conjoint and cost data , 1993 .

[19]  Jeffrey I. McGill,et al.  Revenue Management: Research Overview and Prospects , 1999, Transp. Sci..

[20]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[21]  Satoru Iwata,et al.  A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.

[22]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[23]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..