We analyze the dynamics of a simple growth model in which production occurs with a delay while new capital is installed (time-to-build). The time-to-build technology is shown to yield a system of functional (delay) differential equations with a unique steady state. We demonstrate that the steady state, though typically a saddle, may exhibit Hopf cycles on a measurable set of the parameter space. Furthermore, the optimal path to the steady state is oscillatory. A counter-example to the claim that intrinsically oscillatory on the central technical apparatus the mathematics of functional differential equations.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Publisher Info
Paper provided by National Bureau of Economic Research, Inc in its series NBER Technical Working Papers with number
0211.
Length: Date of creation: May 1997 Date of revision: Handle: RePEc:nbr:nberte:0211
Note: IFM Contact details of provider: Postal: National Bureau of Economic Research, 1050 Massachusetts Avenue Cambridge, MA 02138, U.S.A. Phone: 617-868-3900 Email: Web page: http://www.nber.org More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: ().
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Did you know? Citation analysis on IDEAS includes online papers that are freely accessible and whose text could be automatically analyzed, currently about 210000 papers.