A note on testing axioms of revealed preference

DOI10.1007/s10957-014-0657-9zbMath1320.91103MaRDI QIDQ495751

Fabrice Talla Nobibon, Frits C. R. Spieksma, Bart Smeulders

Publication date: 15 September 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/469347

zbMATH Keywords

directed graph; generalized axiom of revealed preference; arc coloring; microeconomics; strongly connected components

Mathematics Subject Classification ID

91B10: Group preferences

91B42: Consumer behavior, demand theory

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test, Revealed preference theory: an algorithmic outlook, Complexity results for the weak axiom of revealed preference for collective consumption models, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms

Uses Software

• Stony Brook

Cites Work

• Unnamed Item
• The Nonparametric Approach to Demand Analysis
• Matrix multiplication via arithmetic progressions
• Note on alternating directed cycles
• Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices