A note on testing axioms of revealed preference
From MaRDI portal
(Redirected from Publication:495751)
Recommendations
- On testing for revealed preference conditions
- Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test
- A simplified test for preference rationality of two-commodity choice
- Revealed preference theory: an algorithmic outlook
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
Cites work
- A Theorem on Boolean Matrices
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
- Depth-First Search and Linear Graph Algorithms
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- Matrix multiplication via arithmetic progressions
- Note on alternating directed cycles
- The Nonparametric Approach to Demand Analysis
- The algorithm design manual
Cited in
(9)- Testing strictly concave rationality
- Revealed preference theory: an algorithmic outlook
- Testing substitutability
- On testing substitutability
- A simplified test for preference rationality of two-commodity choice
- 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
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)