How Do We Know What We Know? Learning from Monte Carlo Simulations

被引:1
作者
Hopkins, Vincent [1 ]
Kagalwala, Ali [2 ]
Philips, Andrew Q. [3 ]
Pickup, Mark [4 ]
Whitten, Guy D. [5 ]
机构
[1] Univ British Columbia, Dept Polit Sci, Vancouver, BC V6T 1Z1, Canada
[2] Texas A&M Univ, Bush Sch Govt & Publ Serv, Dept Polit Sci, College Stn, TX 77843 USA
[3] Univ Colorado, Dept Polit Sci, Boulder, CO 80309 USA
[4] Simon Fraser Univ, Dept Polit Sci, Burnaby, BC V5A 1S6, Canada
[5] Texas A&M Univ, Bush Sch Govt, Publ Serv, Polit Sci, College Stn, TX USA
关键词
Monte Carlo simulations; RMSE; bias; coverage probability; power; standard deviation; overconfidence; LAG; VARIABLES; MODELS; PANEL;
D O I
10.1086/726934
中图分类号
D0 [政治学、政治理论];
学科分类号
0302 ; 030201 ;
摘要
Monte Carlo simulations are commonly used to test the performance of estimators and models from rival methods, under a range of data-generating processes. This tool improves our understanding of the relative merits of rival methods in different contexts, such as varying sample sizes and violations of assumptions. When used, it is common to report the bias or the root mean squared error of the different methods. It is far less common to report the standard deviation, overconfidence, coverage probability, or power. Each of these six performance statistics provides important, and often differing, information regarding a method's performance. Here, we present a structured way to think about Monte Carlo performance statistics. In replications of three prominent papers, we demonstrate the utility of our approach and provide new substantive results about the performance of rival methods.
引用
收藏
页码:36 / 53
页数:18
相关论文
共 25 条