Algorithms for Multi-product Pricing

  • Gagan Aggarwal
  • Tomás Feder
  • Rajeev Motwani
  • An Zhu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3142)


In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach has been to strategically set prices of various products, taking into account the profiles of consumers. We study algorithms for the multi-product pricing problem, where, given consumer preferences among products, their budgets, and the costs of production, the goal is to set prices of multiple products from a single company, so as to maximize the overall revenue of the company. We present approximation algorithms as well as negative results for several variants of the multi-product pricing problem, modeling different purchasing patterns and market assumptions.


Approximation Factor Total Payoff Revenue Management Preference List Maximum Revenue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asano, T., Williamson, D.: Improved approximation algorithms for MAX SAT. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 96–115 (2000)Google Scholar
  2. 2.
    Coy, P.: The Power of Smart Pricing. Business Week, April 10 (2000)Google Scholar
  3. 3.
    Dobson, G., Kalish, S.: Heuristics for Pricing and Positioning a Product-line Using Conjoint and Cost Data. Management Science 39(2), 160–175 (1993)CrossRefGoogle Scholar
  4. 4.
    General Motors. The Auto Choice Advisor web site,
  5. 5.
    Håastad, J.: Some Optimal Inapproximability results. In: Proceedings of the 28th ACM Symposium on the Theory of Computing, pp. 1–10 (1997)Google Scholar
  6. 6.
    Hansom, W., Martin, K.: Optimal Bundle Pricing. Management Science 36, 155–174 (1990)CrossRefGoogle Scholar
  7. 7.
    Hauser, J.R., Simmie, P.: Profit Maximizing Perceptual Positions:An Integrated Theory for the Selection of Product Features and Price. Management Science 27(1), 33–56 (1981)CrossRefGoogle Scholar
  8. 8.
    Khanna, S., Sudan, M., Williamson, D.: A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. In: Proceedings of the 29th ACM Symposium on the Theory of Computing, pp. 11–20 (1997)Google Scholar
  9. 9.
    McGill, J.I., Van Ryzin, G.: Revenue Management: Research Overview and Prospects. Transportation Science 33(2), 233–256 (1999)zbMATHCrossRefGoogle Scholar
  10. 10.
    McWilliams, G.: Lean Machine: How Dell Fine Tunes Its PC Pricing to Gain Edge in a Slow Market. Wall Street Journal, June 8 (2001)Google Scholar
  11. 11.
    Merrick, A.: Priced toMove: RetailersTry to Get LegUpon MarkdownsWith NewSoftware. Wall Street Journal, August 7 (2001)Google Scholar
  12. 12.
    Rusmevichientong, P.: A Non-Parametric Approach to Multi-Product Pricing: Theory and Application. PhD Thesis (2003)Google Scholar
  13. 13.
    Rusmevichientong, P., Van Roy, B., Glynn, P.: A Non-Parametric Approach to Multi- Product Pricing. Submitted to Operations Research (2002)Google Scholar
  14. 14.
    Weatherford, L.R., Bodily, S.E.: A Taxonomy and Research Overview of Perishable- Asset Revenue Management:Yield Management, Overbooking, and Pricing. Management Science 40(5), 831–844 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Gagan Aggarwal
    • 1
  • Tomás Feder
    • 1
  • Rajeev Motwani
    • 1
  • An Zhu
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations