Pythagorean generalization of testing the equality of two symmetric positive definite matrices

We provide a new test for equality of two symmetric positive-definite matrices that leads to a convenient mechanism for testing specification using the information matrix equality or the sandwich asymptotic covariance matrix of the GMM estimator. The test relies on a new characterization of equality between two $k$ dimensional symmetric positive-definite matrices $A$ and $B$: the traces of $A{B}^{?1}$ and $B{A}^{?1}$ are equal to $k$ if and only if $A=B$. Using this simple criterion, we introduce a class of omnibus test statistics for equality and examine their null and local alternative approximations under some mild regularity conditions. A preferred test in the class with good omni-directional power is recommended for practical work. Monte Carlo experiments are conducted to explore performance characteristics under the null and local as well as fixed alternatives. The test is applicable in many settings, including GMM estimation, SVAR models and high dimensional variance matrix settings.     

The cointegrated vector autoregressive model with general deterministic terms

In the cointegrated vector autoregression (CVAR) literature, deterministic terms have until now been analyzed on a case-by-case, or as-needed basis. We give a comprehensive unified treatment of deterministic terms in the additive model $X_t=\gamma Z_t+Y_t$, where $Z_t$ belongs to a large class of deterministic regressors and $Y_t$ is a zero-mean CVAR. We suggest an extended model that can be estimated by reduced rank regression, and give a condition for when the additive and extended models are asymptotically equivalent, as well as an algorithm for deriving the additive model parameters from the extended model parameters. We derive asymptotic properties of the maximum likelihood estimators and discuss tests for rank and tests on the deterministic terms. In particular, we give conditions under which the estimators are asymptotically (mixed) Gaussian, such that associated tests are ${\chi }^2$-distributed.     

Asymptotics for LS,GLS, and feasible GLS statistics in an AR(1) model with conditional heteroskedasticity

We consider a first-order autoregressive model with conditionally heteroskedastic innovations. The asymptotic distributions of least squares (LS), infeasible generalized least squares (GLS), and feasible GLS estimators and $t$ statistics are determined. The GLS procedures allow for misspecification of the form of the conditional heteroskedasticity and, hence, are referred to as quasi-GLS procedures. The asymptotic results are established for drifting sequences of the autoregressive parameter ${\rho }_n$ and the distribution of the time series of innovations. In particular, we consider the full range of cases in which ${\rho }_n$ satisfies $n(1?{\rho }_n)\to \infty$ and $n(1?{\rho }_n)\to h_1\in [0,\infty )$ as $n\to \infty$, where $n$ is the sample size. Results of this type are needed to establish the uniform asymptotic properties of the LS and quasi-GLS statistics.     

Consistent inference in fixed-effects stochastic frontier models

The classical stochastic frontier panel data models provide no mechanism to disentangle individual time invariant unobserved heterogeneity from inefficiency. Greene (2005a, b) proposed the so-called “true” fixed-effects specification that distinguishes these two latent components. However, due to the incidental parameters problem, his maximum likelihood estimator may lead to biased variance estimates. We propose two alternative estimators that achieve consistency for $n\to \infty$ with fixed $T$. Furthermore, we extend the Chen et al. (2014) results providing a feasible estimator when the inefficiency is heteroskedastic and follows a first-order autoregressive process. We investigate the behavior of the proposed estimators through Monte Carlo simulations showing good finite sample properties, especially in small samples. An application to hospitals’ technical efficiency illustrates the usefulness of the new approach.     

Locally robust contracts for moral hazard

We consider a moral hazard problem in which the principal has a slight uncertainty about how the agent’s actions translate into output. An incentive contract can be made robust against an $ϵ$ amount of uncertainty, at the cost of a loss to the principal on the order of $\sqrt{ϵ}$, by refunding a small fraction of profit to the agent. We show that as $ϵ$ goes to zero, this construction is essentially optimal, in the sense of minimizing the worst-case loss, among all modifications to the contract that do not depend on the details of the environment.     

Characterizing lexicographic preferences

We characterize lexicographic preferences on product sets of finitely many coordinates. The main new axiom is a robustness property. It roughly requires this: Suppose $x$ is preferred to $y$; many of its coordinates indicate that the former is better and only a few indicate the opposite. Then the decision maker is allowed a change of mind turning one coordinate in favor of $x$ to an indifference: even if one less argument supports the preference, the fact that we started with many arguments in favor of $x$ suggests that such a small change is not enough to give rise to the opposite preference.