A note on testing axioms of revealed preference

DOI10.1007/s10957-014-0657-9zbMath1320.91103OpenAlexW2004042409MaRDI 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 graphgeneralized axiom of revealed preferencearc coloringmicroeconomicsstrongly connected components

Mathematics Subject Classification ID

Group preferences (91B10) Consumer behavior, demand theory (91B42) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

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 ⋮ Revealed preference theory: an algorithmic outlook ⋮ Complexity results for the weak axiom of revealed preference for collective consumption models

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

This page was built for publication: A note on testing axioms of revealed preference