Bidders’ risk attitudes have important implications for sellers seeking to maximize expected revenues. In ascending auctions, auction theory predicts bid distributions in Bayesian Nash equilibrium does not convey any information about bidders' risk preference. We propose a new approach for...

This note proposes a tool to investigate and demonstrate the adequacy of the central limit theorem in small samples. The suggested testing procedure provides a method to investigate if the mean estimator is approximately normally distributed, given data and sample size at hand. This is important...

The LM type linearity test for STAR nonlinearities is severely distorted when the process is governed by conditional heteroskedasticity. In order to correct the test we propose a parametric bootstrap. It is shown, by means of Monte Carlo methods, that the bootstrap test is almost exact.

We propose a new method of testing stochastic dominance which improves on existing tests based on bootstrap or subsampling. Our test requires estimation of the contact sets between the marginal distributions. Our tests have asymptotic sizes that are exactly equal to the nominal level uniformly...

Modelling multivariate failure times in a competing risks setting is often performed by assuming independence between risks. However, by wrongly assuming independence, seriously biased parameter estimates may result. The aim of this paper is to evaluate a test for independence previously...

This paper presents a Monte Carlo simulation study of the bootstrap algorithm proposed by Löthgren and Tambour (1997) for calculation of bootstrap confidence intervals for the firm-specific Data Envelopment Analysis (DEA) Malmquist productivity index. The simulation results indicate that the...

This paper evaluates the performance of three bootstrap algorithms for the data envelopment analysis (DEA) estimator using a Monte Carlo simulation study. The Löthgren and Tambour (1997) (LT) algorithm; the Simar and Wilson (1997b) (SW) algorithm; and a combination of the LT and SW algorithms...