LEARNABILITY OF E–STABLE EQUILIBRIA

Atanas Christev and Sergey Slobodyan

Macroeconomic Dynamics, 2014, vol. 18, issue 5, 959-984

Abstract: If private sector agents update their beliefs with a learning algorithm other than recursive least squares, expectational stability or learnability of rational expectations equilibria (REE) is not guaranteed. Monetary policy under commitment, with a determinate and E-stable REE, may not imply robust learning stability of such equilibria if the RLS speed of convergence is slow. In this paper, we propose a refinement of E-stability conditions that allows us to select equilibria more robust to specification of the learning algorithm within the RLS/SG/GSG class. E-stable equilibria characterized by faster speed of convergence under RLS learning are learnable with SG or generalized SG algorithms as well.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cup:macdyn:v:18:y:2014:i:05:p:959-984_00

Access Statistics for this article

More articles in Macroeconomic Dynamics from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().