DMCA
An O(n²) Algorithm for Testing the Generalized Axiom of Revealed Preference
by
Fabrice Talla Nobibon
,
Bart Smeulders
,
Frits C. R. Spieksma
BibTeX
@MISC{Nobibon_ano(n²),
author = {Fabrice Talla Nobibon and Bart Smeulders and Frits C. R. Spieksma},
title = { An O(n²) Algorithm for Testing the Generalized Axiom of Revealed Preference},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n²), 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.
