IDEAS home Printed from https://ideas.repec.org/p/ore/uoecwp/2005-4.html
   My bibliography  Save this paper

Learning, the Forward Premium Puzzle and Market Efficiency

Author

Listed:
  • Avik Chakraborty

    (University of Oregon - Student)

Abstract

The Forward Premium Puzzle is one of the most prominent empirical anomalies in international finance. The forward premium predicts exchange rate depreciation but typically with the opposite sign and smaller magnitude than specified by rational expectations, a result also considered to indicate inefficiency in the foreign exchange market. This paper proposes a resolution of the puzzle based on recursive least squares learning applied to a simple model of exchange rate determination. The key assumption is that risk neutral agents are not blessed with rational expectations and do not have perfect knowledge about the market. Agents learn about the parameters underlying the stochastic process generating the exchange rate using constant gain recursive least squares. When exchange rate data are generated from the model and the empirical tests are performed, for plausible parameter values the results replicate the anomaly along with other observed empirical features of the forward and spot exchange rate data.

Suggested Citation

  • Avik Chakraborty, 2004. "Learning, the Forward Premium Puzzle and Market Efficiency," University of Oregon Economics Department Working Papers 2005-4, University of Oregon Economics Department, revised 01 Oct 2004.
    • Handle: RePEc:ore:uoecwp:2005-4
    as

    Download full text from publisher

    File URL: http://economics.uoregon.edu/papers/UO-2005-4_Chakraborty_Puzzle.pdf
    Download Restriction: no
    ---><---

    Citations

    Blog mentions

    As found by EconAcademics.org, the blog aggregator for Economics research:
    1. In praise of belief in efficient markets
      by chris dillow in Stumbling and Mumbling on 2009-02-13 17:14:47

    More about this item

    Keywords

    Spot Exchange Rate; Forward Rate; Constant-gain Recursive Least Squares Learning.;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:ore:uoecwp:2005-4. 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: Bill Harbaugh (email available below). General contact details of provider: https://edirc.repec.org/data/deuorus.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.