Add to ORKGAbstract. 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 an algorithm to test the law of aggregate demand with runtime complexity polynomial to th...
We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non...
Revealed preference theory is a domain within economics that studies rationalizability of behavior b...
This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n...
This Note presents an algorithm for testing the generalized axiom of revealed preference that runs i...
We prove that the problem of testing whether data of consumption expenditures satisfy the Collective...
We prove that the problem of testing whether data of consumption expenditures satisfy the Collective...
We provide results on the computational complexity of goodness-of-fit measures (i.e., Afriat’s effic...
We provide results on the computational complexity of goodness-of-fit measures (i.e. Afriat's effici...
Consider a set R of m binary relations on a set of n boolean variables. R may imply a contradiction,...
We consider the computational problem of testing whether observed household consumption behavior sat...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
The number of comparisons required to select he i-th smallest of n numbers is shown to be at most a ...
We provide a simplified test to determine if choice data from a two-commodity consumption set satisf...
A procedure to test for the significance of violations of revealed preference conditions is describe...
We provide an algorithm to test the law of aggregate demand with runtime complexity polynomial to th...
We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non...
Revealed preference theory is a domain within economics that studies rationalizability of behavior b...
This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n...
This Note presents an algorithm for testing the generalized axiom of revealed preference that runs i...
We prove that the problem of testing whether data of consumption expenditures satisfy the Collective...
We prove that the problem of testing whether data of consumption expenditures satisfy the Collective...
We provide results on the computational complexity of goodness-of-fit measures (i.e., Afriat’s effic...
We provide results on the computational complexity of goodness-of-fit measures (i.e. Afriat's effici...
Consider a set R of m binary relations on a set of n boolean variables. R may imply a contradiction,...
We consider the computational problem of testing whether observed household consumption behavior sat...
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a...
The number of comparisons required to select he i-th smallest of n numbers is shown to be at most a ...
We provide a simplified test to determine if choice data from a two-commodity consumption set satisf...
A procedure to test for the significance of violations of revealed preference conditions is describe...
We provide an algorithm to test the law of aggregate demand with runtime complexity polynomial to th...
We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non...
Revealed preference theory is a domain within economics that studies rationalizability of behavior b...