Focusing on the testable implications on the equilibrium manifold, we show that the rationalizability problem is NP-complete. Subsequently, we present an integer programming (IP) approach to characterizing general equilibrium models. This approach avoids the use of the Tarski-Seidenberg...

We propose a nonparametric approach to multiple calibration of numerical general equilibrium models, where counterfactual equilibria are solutions to the Walrasian inequalities. We present efficient approximation schemes for deciding the solvability of Walrasian inequalities