A Note on Testing Axioms of Revealed Preference

Fabrice Talla Nobibon, Bart Smeulders () and Frits C. R. Spieksma
Additional contact information
Fabrice Talla Nobibon: KU Leuven
Bart Smeulders: KU Leuven
Frits C. R. Spieksma: KU Leuven

Journal of Optimization Theory and Applications, 2015, vol. 166, issue 3, No 19, 1063-1070

Abstract: Abstract 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.

Keywords: Generalized axiom of revealed preference; Directed graph; Strongly connected components; Arc coloring; Microeconomics; AMS 91A26; AMS 91B10; AMS 0C15; AMS 05C85 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0657-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
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:spr:joptap:v:166:y:2015:i:3:d:10.1007_s10957-014-0657-9

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-014-0657-9

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().