Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test

DOI10.1016/j.jmateco.2016.09.003zbMath1368.91126OpenAlexW3121307755MaRDI QIDQ343120

Kohei Shiozawa

Publication date: 25 November 2016

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11094/51742

zbMATH Keywords

revealed preferenceshortest path problemrationalizabilityAfriat's inequalitiesgeneralized axiom of revealed preference

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Utility theory (91B16) Consumer behavior, demand theory (91B42)

Related Items (1)

Revealed preference theory: an algorithmic outlook

Cites Work

• The Nonparametric Approach to Demand Analysis
• Remarks on Afriat's theorem and the Monge-Kantorovich problem
• Afriat's theorem for indivisible goods
• A note on testing axioms of revealed preference
• The nonparametric approach to applied welfare analysis
• Afriat's theorem for general budget sets
• A necessary and sufficient condition for rationalizability in a quasilinear context
• Two new proofs of Afriat's theorem
• Non-Parametric Tests of Consumer Behaviour
• Axioms of Revealed Preference for Nonlinear Choice Sets
• On a System of Inequalities in Demand Analysis: An Extension of the Classical Method
• On Generalized Revealed Preference Analysis
• Revealed Preference--A Structural Analysis
• The Construction of Utility Functions from Expenditure Data
• Depth-First Search and Linear Graph Algorithms
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test