Munich Personal RePEc Archive

Programming identification criteria in simultaneous equation models

Halkos, George and Tsilika, Kyriaki (2012): Programming identification criteria in simultaneous equation models.

[img]
Preview
PDF
MPRA_paper_43467.pdf

Download (216kB) | Preview

Abstract

Examining the identification problem in the context of a linear econometric model can be a tedious task. The order condition of identifiability is an easy condition to compute, though difficult to remember. The application of the rank condition, due to its complicated definition and its computational demands, is time consuming and contains a high risk for errors. Furthermore, possible miscalculations could lead to wrong identification results, which cannot be revealed by other indications. Thus, a safe way to test identification criteria is to make use of computer software. Specialized econometric software can off-load some of the requested computations but the procedure of formation and verification of the identification criteria are still up to the user. In our identification study we use the program editor of a free computer algebra system, Xcas. We present a routine that tests various identification conditions and classifies the equations under study as «under-identified», «just-identified», «over-identified» and «unidentified», in just one entry.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.