Afriat, S. N. 1967. "The Construction of Utility Functions from Expenditure Data. " Internat. Econ. Rev. 8 (1): 67-77.
Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall.
Arora, S., and B. Barak. 2009. Computational Complexity: A Modern Approach. Cambridge: Cambridge Univ. Press.
Deb, R., and M. Pai. 2013. "The Geometry of Revealed Preference. " Working paper, Univ. Toronto.
Echenique, F., S. Lee, and M. Shum. 2011. "The Money Pump as a Measure of Revealed Preference Violations. " J.P.E. 119 (6): 1201-23.
Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability. San Francisco: Freeman.
Houtman, M., and J. Maks. 1985. "Determining All Maximal Data Subsets Consistent with Revealed Preference. " Kwantitatieve Methoden 19:89-104.
Megiddo, N. 1979. "Combinatorial Optimization with Rational Objective Functions. " Math. Operations Res. 4 (4): 414-24.
Smeulders, B., F. C. R. Spieksma, L. Cherchye, and B. De Rock. Forthcoming. "Goodness of Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms. " ACM Trans. Econ. and Computation.
Varian, H. R. 1982. "The Nonparametric Approach to Demand Analysis. " Econometrica 50 (4): 945-73.
