A Note on Testing Axioms of Revealed Preference

作者：Nobibon Fabrice Talla; Smeulders Bart^*; Spieksma Frits C R

来源：Journal of Optimization Theory and Applications, 2015, 166(3): 1063-1070.

DOI：10.1007/s10957-014-0657-9

• Generalized axiom of revealed preference
• Directed graph
• Strongly connected components
• Arc coloring
• Microeconomics

This Note presents an algorithm for testing the generalized axiom of revealed preference that runs in quadratic time. We show that this algorithm can be used to solve a more general problem on graphs. Furthermore, we prove a lower bound on the running time of any algorithm for testing different axioms of revealed preference.

• 出版日期2015-9
• 单位KU Leuven