We compare heteroskedasticity-robust inference methods with a large-scale Monte Carlo study based on regressions from 155 reproduction packages of leading economic journals. The results confirm established wisdom and uncover new insights. Among well established methods HC2 standard errors with...

In today’s data-driven world, organizations generate and collect vast amounts of information, yet not all data is managed or utilized with the same degree of efficiency and purpose. This paper investigates the taxonomy and distinctions among white data, grey data, and dark data, offering a...

This paper demonstrates that if we intend to optimally rank order n objects (candidates) each of which has m attributes or rank scores awarded by m evaluators, then the ordinal ranking of objects by the conventional principal component based factor scores turns out to be suboptimal. Three...

In this report, we outline a method for approximating a Markovian (or feedback-Nash) equilibrium of a dynamic game, possibly subject to coupled-constraints. We treat such a game as a "multiple" optimal control problem. A method for approximating a solution to a given optimal control problem via...

Rank-ordering of individuals or objects on multiple criteria has many important practical applications. A reasonably representative composite rank ordering of multi-attribute objects/individuals or multi-dimensional points is often obtained by the Principal Component Analysis, although much...

This is an exploratory study that attempts to identify and provide empirical evidence on the possible determinants of the market capitalisation of the Harare Stock Exchange (HSE) with the view of understanding the development prospects of the HSE and other similar markets. The study used...

This document describes program code for the solution and estimation of dynamic discrete games of incomplete information using the Nested Pseudo Likelihood (NPL) method in Aguirregabiria and Mira (2007). The code is illustrated using a dynamic game of store location by retail chains, and actual...

The last years have seen an explosion in the demand for data science skills. In this paper, I introduce the reader to the term, point out the technological jumps that allowed the rise of its methods, and give an overview of the most common ones. I close by pointing out the strengths and...

In simulation we often have to generate correlated random variables by giving a reference intercorrelation matrix, R or Q. The matrix R is positive definite and a valid correlation matrix. The matrix Q may appear to be a correlation matrix but it may be invalid (negative definite). With R(m,m)...

The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (negative semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2. In the literature on this problem, 'nearest' is invariably defined in...