We provide two methods to compute the largest subset of a set of observations that is consistent with the Generalised Axiom of Revealed Preference. The algorithm provided by Houtman and Maks (1985) is not computationally feasible for larger data sets, while our methods are not limited in that...

We present the revealed preference conditions that characterize the data sets that are consistent with the maximization of a weakly separable utility function. We show that verifying these revealed preference conditions is np-hard. We also present an integer programming approach, which is...

type="main" xml:lang="en" <title type="main">Abstract</title> <p>One of the most cited studies within the field of binary choice models is that of Klein and Spady (1993), in which the authors propose a semiparametric estimator for use when the distribution of the error term is unknown. However, although theoretically...</p>

Revealed preference tests are frequently used to check data on the behavior of agents for consistency with economic theory. Unfortunately these tests lack a stochastic element and thus one violation of revealed preference causes a rejection of the behavior being tested. To remedy this lack of a...

Enflo K. and Hjertstrand P. Relative sources of European regional productivity convergence: a bootstrap frontier approach, Regional Studies. This paper addresses the issue of Western European regional productivity growth and convergence by means of data envelopment analysis (DEA), decomposing...