When is the probabilistic serial assignment uniquely efficient and envy-free?

We study the problem of allocating objects using lotteries. For each economy, the serial assignment, the assignment selected by the (probabilistic) serial rule, is $sd$-efficient and $sd$-envy-free (“$sd$” stands for stochastic dominance) but in general, it is not the only such assignment. Our question is when the uniqueness also holds. First, we provide a necessary condition for uniqueness, termed top-objects divisibility. Exploiting the structure revealed by top-objects divisibility, we then provide two sufficient conditions: preference richness and recursive decomposability. Existing sufficient conditions are restrictive in that they are satisfied only if there are sufficiently many agents relative to the number of objects; and that they only focus on preferences, ignoring other aspects of the problem that are also relevant to uniqueness. Our conditions overcome these limitations and can explain uniqueness for a wide range of economies.     

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.     

Neglected heterogeneity in moment condition models

The central concern of this paper is parameter heterogeneity in models specified by a number of unconditional or conditional moment conditions and thereby the provision of a framework for the development of apposite optimal $m$-tests against its potential presence. We initially consider the unconditional moment restrictions framework. Optimal $m$-tests against moment condition parameter heterogeneity are derived with the relevant Jacobian matrix obtained in terms of the second order own derivatives of the moment indicator in a leading case. GMM and GEL tests of specification based on generalized information matrix equalities appropriate for moment-based models are described and their relation to optimal $m$-tests against moment condition parameter heterogeneity examined. A fundamental and important difference is noted between GMM and GEL constructions. The paper is concluded by a generalization of these tests to the conditional moment context and the provision of a limited set of simulation experiments to illustrate the efficacy of the proposed tests.     

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.     

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.     

Mining big data using parsimonious factor,machine learning,variable selection and shrinkage methods

A number of recent studies in the economics literature have focused on the usefulness of factor models in the context of prediction using “big data” (see Bai and Ng, 2008; Dufour and Stevanovic, 2010; Forni, Hallin, Lippi, & Reichlin, 2000; Forni et al., 2005; Kim and Swanson, 2014a; Stock and Watson, 2002b, 2006, 2012, and the references cited therein). We add to this literature by analyzing whether “big data” are useful for modelling low frequency macroeconomic variables, such as unemployment, inflation and GDP. In particular, we analyze the predictive benefits associated with the use of principal component analysis (PCA), independent component analysis (ICA), and sparse principal component analysis (SPCA). We also evaluate machine learning, variable selection and shrinkage methods, including bagging, boosting, ridge regression, least angle regression, the elastic net, and the non-negative garotte. Our approach is to carry out a forecasting “horse-race” using prediction models that are constructed based on a variety of model specification approaches, factor estimation methods, and data windowing methods, in the context of predicting 11 macroeconomic variables that are relevant to monetary policy assessment. In many instances, we find that various of our benchmark models, including autoregressive (AR) models, AR models with exogenous variables, and (Bayesian) model averaging, do not dominate specifications based on factor-type dimension reduction combined with various machine learning, variable selection, and shrinkage methods (called “combination” models). We find that forecast combination methods are mean square forecast error (MSFE) “best” for only three variables out of 11 for a forecast horizon of $h=1$, and for four variables when $h=3$ or $12$. In addition, non-PCA type factor estimation methods yield MSFE-best predictions for nine variables out of 11 for $h=1$, although PCA dominates at longer horizons. Interestingly, we also find evidence of the usefulness of combination models for approximately half of our variables when $h>1$. Most importantly, we present strong new evidence of the usefulness of factor-based dimension reduction when utilizing “big data” for macroeconometric forecasting.     

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.