Afriat ’ s Theorem and Negative Cycles Teo
暂无分享,去创建一个
This note provides a short proof of Afriat’s theorem and shows that the problem is equivalent to the problem of identifying a negative length cycle in a related graph.
[1] M. J. Todd,et al. Two new proofs of Afriat’s theorem , 2003 .
[2] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[3] Walter Diewert,et al. Afriat and Revealed Preference Theory , 1973 .