A revealed preference approach to computational complexity in economics
Open Access
- 5 June 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 101-110
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Settling the complexity of computing two-player Nash equilibriaJournal of the ACM, 2009
- A path to the Arrow–Debreu competitive market equilibriumMathematical Programming, 2006
- Uniqueness, Stability, and Comparative Statics in Rationalizable Walrasian MarketsEconometrica, 2000
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Testable Restrictions on the Equilibrium ManifoldEconometrica, 1996
- Axioms of Revealed Preference for Nonlinear Choice SetsEconometrica, 1991
- Rationality in Psychology and EconomicsThe Journal of Business, 1986
- Efficiency Estimation of Production FunctionsInternational Economic Review, 1972
- The Construction of Utility Functions from Expenditure DataInternational Economic Review, 1967
- A Note on the Pure Theory of Consumer's BehaviourEconomica, 1938