Consistent subsets: Computationally feasible methods to compute the Houtman–Maks-index

Jan Heufer and Per Hjertstrand

Economics Letters, 2015, vol. 128, issue C, 87-89

Abstract: 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 respect. The first method is an application of Gross and Kaiser’s (1996) approximate algorithm and is only applicable for two-dimensional data sets, but it is very fast and easy to implement. The second method is a mixed-integer linear programming approach that is slightly more involved but still fast and not limited by the dimension of the data set.

Keywords: Demand theory; Efficiency; Non-parametric analysis; Revealed preference; Utility maximisation (search for similar items in EconPapers)
JEL-codes: C14 D11 D12 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165176515000348
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Consistent Subsets – Computationally Feasible Methods to Compute the Houtman-Maks-Index (2014)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ecolet:v:128:y:2015:i:c:p:87-89

DOI: 10.1016/j.econlet.2015.01.024

Access Statistics for this article

Economics Letters is currently edited by Economics Letters Editorial Office

More articles in Economics Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().