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

This paper presents some substantial relationships between the revealed preference test for a data set and the shortest path problem of a weighted graph. We give a unified perspective of several forms of rationalizability tests based on the shortest path problem and an additional graph theoretic structure, which we call the shortest path problem with weight adjustment. Furthermore, the proposed structure is used to extend the result of Quah (2014), which sharpened classical Afriat's Theorem-type results.