Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/cambridge-university-press/tractable-falsifiability-Ty3hTqWhNx
References (30)
-
F. Echenique, D. Golovin, A. Wierman (2011)
A revealed preference approach to computational complexity in economics -
Shankar Kalyanaraman, C. Umans (2009)
The Complexity of Rationalizing Network Formation2009 50th Annual IEEE Symposium on Foundations of Computer Science
-
Christopher Chambers, F. Echenique, E. Shmaya (2017)
General Revealed Preference TheoryTheoretical Economics, 12
-
A. Shamir (1992)
IP = PSPACE -
L. Fortnow, R. Vohra (2008)
The complexity of forecast testingElectron. Colloquium Comput. Complex., TR06
-
L. Babai (1985)
Trading group theory for randomness -
(2002)
Rationalizing choice functions by multiple -
Dan Suciu, V. Vianu (2006)
IntroductionJ. ACM, 53
-
(2012)
Expressible inspections. Theoretical Economics 8: 263–280 -
Christopher Chambers, F. Echenique, E. Shmaya (2014)
The Axiomatic Structure of Empirical ContentThe American Economic Review, 104
-
R. Impagliazzo (1995)
A personal view of average-case complexityProceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
-
(2010)
The computational complexity of rationalizing -
Oded Goldreich (2008)
Computational complexity: a conceptual perspectiveSIGACT News, 39
-
L. Levin (1986)
Average Case Complete ProblemsSIAM J. Comput., 15
-
(1989)
and C -
M. Johannesson (1996)
The Revealed Preference Approach -
S. Goldwasser, S. Micali, C. Rackoff (1985)
The knowledge complexity of interactive proof-systems -
F. Hayek (2007)
The American Economic Review -
T. Demuynck (2010)
The Computational Complexity of Boundedly Rational Choice BehaviorERN: Computational Techniques (Topic)
-
Alvaro Sandroni, W. Olszewski (2008)
FalsifiabilityPenn Institute for Economic Research (PIER) Working Paper Series
-
(2012)
Expressible inspections -
O. Spies (1954)
The aim and structure of physical theoryJournal of The Franklin Institute-engineering and Applied Mathematics, 257
-
(2011)
General revealed preference theory. Caltech SS Working Paper 1332 -
Shankar Kalyanaraman, C. Umans (2008)
The Complexity of Rationalizing MatchingsElectron. Colloquium Comput. Complex., TR08
-
G. Kalai, A. Rubinstein, R. Spiegler (2002)
Rationalizing choice functions by multiple rationalesEconometrica, 70
-
T. Demuynck (2011)
The computational complexity of rationalizing Pareto optimal choice behaviorSocial Choice and Welfare, 42
-
Ethan Bernstein, U. Vazirani (1993)
Quantum complexity theoryProceedings of the twenty-fifth annual ACM symposium on Theory of Computing
-
(2014)
The axiomatic structure -
Jose Apesteguia, Miguel Ballester (2010)
The Computational Complexity of Rationalizing BehaviorJournal of Mathematical Economics, 46
-
Shamir (1993) proved that the classes IP and PSPACE are identical
- Publisher
- Cambridge University Press
- Copyright
- Copyright © Cambridge University Press 2015
- ISSN
- 1474-0028
- eISSN
- 0266-2671
- DOI
- 10.1017/S0266267115000127
- Publisher site
- See Article on Publisher Site
Abstract
Abstract:We propose to strengthen Popper’s notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a ‘short proof’ of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some examples of economic theories that are falsifiable in the usual sense but not with this additional requirement. We consider several variants of the definition of ‘short proof’ and several assumptions about the difficulty of computation, and study their different implications on the falsifiability of theories.
Journal
Economics & Philosophy – Cambridge University Press
Published: May 7, 2015
Keywords: Falsifiability; computational complexity