Learning and convergence to a full-information equilibrium are not equivalent

被引:3
作者
Jun, BY [1 ]
Vives, X [1 ]
机构
[1] CSIC, INST ANAL ECON, BARCELONA, SPAIN
关键词
D O I
10.2307/2297798
中图分类号
F [经济];
学科分类号
02 ;
摘要
Convergence to a full-information equilibrium (FIE) in the presence of persistent shocks and asymmetric information about an unknown payoff-relevant parameter theta is established in a classical infinite-horizon partial equilibrium linear model. It is found that, under the usual stability assumptions on the autoregressive process of shocks, convergence occurs at the rate n(-1/2), where n is the number of rounds of trade, and that the asymptotic variance of the discrepancy of the full-information price and the market price is independent of the degree of autocorrelation of the shocks. This is so even though the speed of learning theta from prices becomes arbitrarily slow as autocorrelation approaches a unit root level. It follows then that learning the unknown parameter theta and convergence of the equilibrium process to the FIE are not equivalent. Moreover, allowing for non-stationary processes of shocks, the distinction takes a more stark form. Learning theta is neither necessary nor sufficient for convergence to the FIE. When the process of shocks has a unit root, convergence to the FIE occurs but theta can not be learned. When the process is sufficiently explosive and there is a positive mass of perfectly informed agents, theta is learned quickly but convergence to the FIE does not occur.
引用
收藏
页码:653 / 674
页数:22
相关论文
共 50 条
[41]   FULL-INFORMATION BEST-CHOICE PROBLEM WITH FINITE MEMORY. [J].
Tamaki, Mitsushi .
1600, (23)
[42]   The effect of prenatal care on birthweight: a full-information maximum likelihood approach [J].
Rous, JJ ;
Jewell, RT ;
Brown, RW .
HEALTH ECONOMICS, 2004, 13 (03) :251-264
[43]   A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip [J].
Haitner, Iftach ;
Karidi-Heller, Yonatan .
2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, :1268-1276
[44]   OPTIMAL STOPPING RULE FOR THE FULL-INFORMATION DURATION PROBLEM WITH RANDOM HORIZON [J].
Tamaki, Mitsushi .
ADVANCES IN APPLIED PROBABILITY, 2016, 48 (01) :52-68
[45]   Exploring the Full-Information Bifactor Model in Vertical Scaling With Construct Shift [J].
Li, Ying ;
Lissitz, Robert W. .
APPLIED PSYCHOLOGICAL MEASUREMENT, 2012, 36 (01) :3-20
[46]   Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback [J].
Zhang, Mingrui ;
Chen, Lin ;
Hassani, Hamed ;
Karbasi, Amin .
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
[47]   Performance of the S-χ2 Statistic for Full-Information Bifactor Models [J].
Li, Ying ;
Rupp, Andre A. .
EDUCATIONAL AND PSYCHOLOGICAL MEASUREMENT, 2011, 71 (06) :986-1005
[48]   Comparison of Full-Information and Limited-Information methods for Bi-Factor model [J].
Liu, Tiechuan ;
Dai, Haiqi ;
Zhao, Yu .
Advances in Information Sciences and Service Sciences, 2012, 4 (11) :11-18
[49]   On self-triggered full-information H-infinity controllers [J].
Lemmon, Michael ;
Chantem, Thidapat ;
Hu, Xiaobo Sharon ;
Zyskowski, Matthew .
HYBRID SYSTEMS: COMPUTATION AND CONTROL, PROCEEDINGS, 2007, 4416 :371-+
[50]   The full-information best-choice problem with uniform or gamma horizons [J].
Bendersky, Michael ;
David, Israel .
OPTIMIZATION, 2016, 65 (04) :765-778