This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n2), where n is the number of observations in a given data set. Furthermore, we prove a lower bound of (n log n) on the running time of any algorithm for testing different axioms of revealed preference

We provide results on the computational complexity of goodness of t measures (i.e. Afriat's effi ciency index, Varian's effi ciency vector-index and the Houtman-Maks index) associated with several revealed preference axioms (i.e. WARP, SARP, GARP and HARP). These results explain the...