To create their rankings, university-ranking agencies usually combine multiple performance measures into a composite index. However, both rankings and index scores are sensitive to the weights assigned to performance measures. This paper uses a stochastic dominance efficiency methodology to...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

In this paper we consider inference procedures for two types of dynamic linear panel data models with fixed effects. First, we show that the closure of the stationary ARMA panel model with fixed effects can be consistently estimated by the First Difference Maximum Likelihood Estimator and we...

The mean-variance portfolio optimization theory of Markowitz assumes that stock returns are distributed according to normal probability density functions (pdfs). In reality, stock returns are more accurately described by leptokurtic pdfs which have kurtosis greater than zero. Stocks with...

Much of the trading activity in Equity markets is directed to brokerage houses. In exchange they provide so-called quot;soft dollarsquot; which basically are amounts spent in quot;researchquot; for identifying profitable trading opportunities. Soft dollars represent about USD 1 out of every USD...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...