Convergence to Rational Expectations in a Stationary Linear Game

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Published Date

Publisher

Center for Economic Research, Department of Economics, University of Minnesota

Abstract

This paper describes several learning processes which converge, with probability one, to the rational expectations (Bayesian-Nash) equilibrium of a stationary linear game. The learning processes include a test for convergence to equilibrium, and a method for changing the parameters of the process when nonconvergence is indicated. This self-stabilization property eliminates the need to impose stability conditions on the economic environment. Convergence to equilibrium is proved for two types of self-stabilizing learning mechanisms: a centralized forecasting mechanism and a decentralized strategy adjustment process. For a version of the decentralized process it is also shown that the publicly observable information, on which learning is based, does not necessarily reveal anything about the economic environment except the equilibrium.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Discussion Paper
1990

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Jordan, J.S., (1990), "Convergence to Rational Expectations in a Stationary Linear Game", Discussion Paper No. 258, Center for Economic Research, Department of Economics, University of Minnesota.

Other identifiers

Suggested citation

Jordan, James S.. (1990). Convergence to Rational Expectations in a Stationary Linear Game. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/55539.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.