Title: A note on testing axioms of revealed preference
Authors: Talla Nobibon, Fabrice ×
Smeulders, Bart
Spieksma, Frits #
Issue Date: 2015
Publisher: Plenum Pub. Corp.
Series Title: Journal of Optimization Theory and Applications vol:166 issue:3 pages:1063-1070
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.
ISSN: 0022-3239
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
A note on Testing Axioms of Revealed Preference.pdfA note on testing axioms of revealed preference Published 140KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science