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

被引：7
|
作者：
Shiozawa, Kohei [1 ]
机构：
[1] Osaka Univ, Grad Sch Econ, 1-7 Machikaneyama Cho, Toyonaka, Osaka 5600043, Japan
来源：
JOURNAL OF MATHEMATICAL ECONOMICS | 2016年 / 67卷
关键词：
Revealed preference; Rationalizability; Afriat's inequalities; Generalized axiom of revealed preference; Shortest path problem; GOODNESS-OF-FIT; AFRIATS THEOREM; NONPARAMETRIC APPROACH; MINIMUM-COST; MONEY PUMP; VIOLATIONS; AXIOMS; SETS;
D O I：
10.1016/j.jmateco.2016.09.003
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
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. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码：38 / 48
页数：11
相关论文
共 50 条
  • [1] The shortest path problem in the Knodel graph
    Grigoryan, Hayk
    Harutyunyan, Hovhannes A.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2015, 31 : 40 - 47
  • [2] The Shortest Path Problem for a Multiple Graph
    Smirnov, A. V.
    [J]. AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2018, 52 (07) : 625 - 633
  • [3] A revealed preference test of rationing
    Fleissig, Adrian R.
    Whitney, Gerald
    [J]. ECONOMICS LETTERS, 2011, 113 (03) : 234 - 236
  • [4] A Hybrid Algorithm for the shortest-path problem in the graph
    Aghaei, Mohammad Reza Soltan
    Zukarnain, Zuriati Ahmad
    Mamat, Ali
    Zainuddin, Hishamuddin
    [J]. 2008 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING, 2008, : 251 - +
  • [5] Generalization of a multicriteria shortest path problem in an oriented graph
    Chernyshev S.V.
    [J]. Moscow University Mathematics Bulletin, 2007, 62 (6) : 213 - 218
  • [6] EXPONENTIAL TRAFFIC ASSIGNMENT AND THE SHORTEST-PATH PROBLEM IN A GRAPH
    FONLUPT, J
    [J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1981, 15 (02): : 165 - 184
  • [7] Generating Random Test Networks for Shortest Path Algorithms
    Adams-Smith, Dennis J.
    Shier, Douglas R.
    [J]. OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 295 - 308
  • [8] AN EMPIRICAL-TEST OF REVEALED PREFERENCE THEORY
    KOO, AYC
    [J]. ECONOMETRICA, 1963, 31 (04) : 646 - 664
  • [9] Dynamic graph generation for the shortest path problem in time expanded networks
    Frank Fischer
    Christoph Helmberg
    [J]. Mathematical Programming, 2014, 143 : 257 - 297
  • [10] Graph Embedding and Approximate Dynamic Programming for the Reliable Shortest Path Problem
    Peng, Qihang
    Guo, Hongliang
    Hu, Chuan
    [J]. 2021 IEEE INTELLIGENT TRANSPORTATION SYSTEMS CONFERENCE (ITSC), 2021, : 653 - 659
12345