Oligopoly Models for Optimal Advertising When Production Costs Obey a Learning Curve
AbstractBusiness policy questions frequently involve competitive encounters among several different firms. Oligopoly theory in economics was devised to answer similar questions, but its results so far are largely confined to cases of monopoly (one firm), duopoly (two firms), and many firms (wheat farmers). The cases with n firms, where 3 \le n \le 10, are of great interest to business policy, but are rarely treated in the economics literature because of their extreme difficulty. The natural mathematical model for studying such questions is the theory of differential games, originally devised by R. Isaacs (Isaacs, R. 1975. Differential Games. Robert E. Krieger Publishing Co., Huntington, New York. Originally published by John Wiley & Sons, New York, 1965.) for pursuer-evader games; later it was extended by J. Case (Case, J. H. 1979. Economics and the Competitive Process. New York University Press, New York.) to nonzero-sum differential games for application to questions of economic competition. The problem of characterizing an optimal advertising policy over time is an important question in the field of marketing. It is especially important during the period of the introduction of a new product; and it is also during this time that the production learning curve phenomenon is most pronounced. In this paper we study oligopoly models which combine elements of Bass's demand growth model (Bass, F. M. 1969. A new product growth model for consumer durables. Management Sci. 15 (January) 215--227.), the Vidale-Wolfe (Vidale, M. L., H. B. Wolfe. 1957. An operations research study of sales response to advertising. Oper. Res. 5 370--381.) and Ozga (Ozga, S. 1960. Imperfect markets through lack of knowledge. Quart. J. Econom. 74 29--52.) advertising models with linear or quadratic costs, and the production learning curve (Hirschmann, W. P. 1964. Profit from the learning curve. Harvard Bus. Rev. 42 (January--February) 125--139; The Boston Consulting Group. 1972. Perspectives on Experience. The Boston Consulting Group, Boston.). In the monopoly case (n = 1), the optimal advertising function is derived by applying Green's theorem. In the duopoly (n = 2) and triopoly (n = 3) cases we use discrete differential game models, and find Nash equilibrium solutions. In each of these models the form of the optimal policy is easy to find, but because of the complicated nature of the resulting differential equations, closed form solutions for the optimal state and control trajectories are impossible to find. Hence we use a computer to compute these optimal trajectories and plot them for various parameter settings. Because 13n parameters must be chosen to define a model with n players, a complete search of the parameter space is clearly impossible. We content ourselves in this paper with presenting computer plots of four different interesting encounters of the triopoly model. Our methods can be extended to work just as well for competitive encounters among n players, where 1 \le n \le 10. We believe that in this paper we have opened up the way to studying oligopoly theory with a small number of participants and under widely varying conditions. Although the lack of closed form solutions may disappoint some readers, we feel that the easy availability of graphical solutions is a more than adequate substitute.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 29 (1983)
Issue (Month): 9 (September)
marketing: advertising/promotion; parameter/scheduling: work studies and learning; games/group decisions;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Mesak, Hani I. & Bari, Abdullahel & Babin, Barry J. & Birou, Laura M. & Jurkus, Anthony, 2011. "Optimum advertising policy over time for subscriber service innovations in the presence of service cost learning and customers' disadoption," European Journal of Operational Research, Elsevier, vol. 211(3), pages 642-649, June.
- Jun, Duk B. & Kim, Seon K. & Park, Yoon S. & Park, Myoung H. & Wilson, Amy R., 2002. "Forecasting telecommunication service subscribers in substitutive and competitive environments," International Journal of Forecasting, Elsevier, vol. 18(4), pages 561-581.
- Teng, Jinn-Tsair & Chern, Maw-Sheng & Kim, Ki-Hee, 2001. "Entry strategies for multinational enterprises and host countries," European Journal of Operational Research, Elsevier, vol. 133(1), pages 62-68, August.
- Erickson, Gary M., 1995. "Differential game models of advertising competition," European Journal of Operational Research, Elsevier, vol. 83(3), pages 431-438, June.
- Teng, Jinn-Tsair & Thompson, Gerald L., 1996. "Optimal strategies for general price-quality decision models of new products with learning production costs," European Journal of Operational Research, Elsevier, vol. 93(3), pages 476-489, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.