This paper shows how revealed preference relations, observed under general budget sets, can be extended using closure operators which impose certain assumptions on preferences. Common extensions are based on the assumption that preferences are convex and/or monotonic, but we also consider...

This paper provides an efficient way to generate a set of random choices on a set of budgets which satisfy the Generalised Axiom of Revealed Preferences (GARP), that is, they are consistent with utility maximisation. The choices are drawn from an approximate uniform distribution on the...

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>