Pricing information bundles in a dynamic environment

  • Authors:
  • Jeffrey O. Kephart;Christopher H. Brooks;Rajarshi Das;Jeffrey K. MacKie-Mason;Robert Gazzale;Edmund H. Durfee

  • Affiliations:
  • Inst. for Advanced Commerce IBM Research, Yorktown Heights, NY;University of Michigan, Ann Arbor, MI;Inst. for Advanced Commerce IBM Research, Yorktown Heights, NY;School of Information and Department of Economics, University of Michigan;School of Information and Department of Economics, University of Michigan;Artificial Intelligence Laboratory, University of Michigan

  • Venue:
  • Proceedings of the 3rd ACM conference on Electronic Commerce
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We explore a scenario in which a monopolist producer of information goods seeks to maximize its profits in a market where consumer demand shifts frequently and unpredictably. The producer may set an arbitrarily complex price schedule---a function that maps the set of purchased items to a price. However, lacking direct knowledge of consumer demand, it cannotcompute the optimal schedule. Instead, it attempts to optimize profits via trial and error. By means of a simple model of consumer demand and a modified version of a simple nonlinear optimization routine, we study a variety of parametrizations of the price schedule and quantify some of the relationships among learnability, complexity, and profitability. In particular, we show that fixed pricing or simple two-parameter dynamic pricing schedules are preferred when demand shifts frequently, but that dynamic pricing based on more complex schedules tends to be most profitable when demand shifts very infrequently.