IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v13y1966i1p1-21.html
   My bibliography  Save this article

Forecasting Non-Stationary Economic Time Series

Author

Listed:
  • D. Couts

    (Arthur D. Little, Inc., San Francisco)

  • D. Grether

    (Yale University)

  • M. Nerlove

    (Yale University)

Abstract

The purpose of this paper is to show how certain results obtained by Peter Whittle [Whittle, P. 1963. Prediction and Regulation by Linear Least Square Methods. English Universities Press, London.] may be used to derive the results on adaptive forecasting obtained by Wage and Nerlove [Nerlove, M., S. Wage. 1964. On the optimality of adaptive forecasting. Management Sci. 10(January) 207-24.] and to carry forward the general program of that paper; namely, to study the prediction of those types of non-stationary and non-deterministic series 1 which can be reduced to stationary series by a finite linear transformation. For this class of non-stationary series it may be shown in general that the optimal forecast for any future period may be expressed as a linear combination of past values of the series, and past one-step prediction errors; they are, in this sense, "adaptive." Unfortunately, this class contains series which, when transformed, have infinite moving average representations. For these series the adaptive representation of the optimal forescats will contain an infinite number of terms, and thus, in terms of the original motivation of adaptive forecasting, be less than helpful. Such considerations do, however, suggest what the limits of applicability of the adaptive representation are, and give a criterion for choosing between the autoregressive and adaptive representations in the case of any particular series. The analysis is illustrated by forecasts of unemployment of males, aged 14-19, one, four, and fifteen months ahead.

Suggested Citation

  • D. Couts & D. Grether & M. Nerlove, 1966. "Forecasting Non-Stationary Economic Time Series," Management Science, INFORMS, vol. 13(1), pages 1-21, September.
  • Handle: RePEc:inm:ormnsc:v:13:y:1966:i:1:p:1-21
    DOI: 10.1287/mnsc.13.1.1
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.13.1.1
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.13.1.1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:13:y:1966:i:1:p:1-21. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.