z-logo
Premium
Optimal R&D investment with learning‐by‐doing: Multiple steady states and thresholds
Author(s) -
Greiner Alfred,
Bondarev Anton
Publication year - 2017
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.2301
Subject(s) - saddle point , variety (cybernetics) , saddle , investment (military) , function (biology) , quality (philosophy) , eigenvalues and eigenvectors , point (geometry) , economics , regular polygon , bifurcation , process (computing) , steady state (chemistry) , computer science , mathematical optimization , microeconomics , mathematics , physics , artificial intelligence , geometry , chemistry , quantum mechanics , nonlinear system , evolutionary biology , politics , political science , law , biology , operating system
Summary In this paper, we present an intertemporal optimization problem of a representative R&D firm that simultaneously invests in horizontal and vertical innovations. We posit that learning‐by‐doing makes the process of quality improvements a positive function of the number of existing technologies with the function displaying a convex‐concave form. We show that multiple steady states can arise with 2 being saddle point stable and 1 unstable with complex conjugate eigenvalues. Thus, a threshold with respect to the variety of technologies exists that separates the 2 basins of attractions. From an economic point of view, this implies that a lock‐in effect can occur such that it is optimal for the firm to produce only few technologies at a low quality when the initial number of technologies falls short of the threshold. Hence, history matters as concerns the state of development implying that past investments and innovations determine whether the firm produces a large or a small variety of high‐ or low‐quality technologies, respectively.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here