A note on testing axioms of revealed preference
DOI10.1007/S10957-014-0657-9zbMATH Open1320.91103OpenAlexW2004042409MaRDI QIDQ495751FDOQ495751
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
directed graphgeneralized axiom of revealed preferencearc coloringmicroeconomicsstrongly connected components
Group preferences (91B10) Graph algorithms (graph-theoretic aspects) (05C85) Consumer behavior, demand theory (91B42) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- The Nonparametric Approach to Demand Analysis
- Depth-First Search and Linear Graph Algorithms
- A Theorem on Boolean Matrices
- Matrix multiplication via arithmetic progressions
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- Note on alternating directed cycles
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
Cited In (6)
- Testing strictly concave rationality
- Revealed preference theory: an algorithmic outlook
- A Complementary Approach to the Strong and Weak Axioms of Revealed Preference
- Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
- Complexity results for the weak axiom of revealed preference for collective consumption models
Uses Software
This page was built for publication: A note on testing axioms of revealed preference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495751)
