This paper provides an extensive Monte-Carlo comparison of severalcontemporary cointegration tests. Apart from the familiar Gaussian basedtests of Johansen, we also consider tests based on non-Gaussianquasi-likelihoods. Moreover, we compare the performance of these parametrictests with tests...

Wetlands provide many important goods and services to human societies, and generate nonuse values as well. Wetlands are also very sensitive ecosystems that are subject to much stress from human activities. Reducing the stress on wetlands requires a spatial matching between physical planning,...

Protection unconstrained by rules often varies substantially over time. Rules-based disciplines likeOECD industrial tariff bindings negotiated under GATT since 1947 and new Uruguay Roundbindings on agricultural and services trade and on developing country industrial tariffs, constrain...

A simple auction-theoretic framework is used to examine symmetric litigation environments where the legal ownership of a disputed asset is unknown to the court. The court observes only the quality of the case presented by each party, and awards the asset to the party presenting the best case....

We prove identification of dependent competing risks models in which each risk has a mixed proportional hazard specification with regressors, and the risks are dependent by way of the unobserved heterogeneity, or frailty, components. We show that the conditions for non-parametric identification...

We propose a novel statistic for testing the structural parameters in Instrumental Variables Regression. The statistic is straightforward to compute and has a limiting distribution that is pivotal with a degrees of freedom parameter that is equal to the number of tested parameters. It therefore...

Root cancellation in Auto Regressive Moving Average (ARMA) models leads tolocal non-identification of parameters. When we use diffuse or normal priorson the parameters of the ARMA model, posteriors in Bayesian analyzes show ana posteriori favor for this local non-identification. We show that the...

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...