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

We propose two algorithms for deciding if systems of Walrasian inequalities are solvable. These algorithms may serve as nonparametric tests for multiple calibration of applied general equilibrium models or they can be used to compute counterfactual equilibria in applied general equilibrium...

In this paper we propose a two-step semiparametric procedure to estimate first-price auction models. In the first-step, we estimate the bid density and distribution using local polynomial method, and recover a sample of (pseudo) private values. In the second-step, we apply the method of moments...

We study a simultaneous, complete-information game played by p = 1 P agents. Each p has an ordinal decision variable Y p ∈ A p ={ 0 1 M p} , where M p can be unbounded, A p is p’s action space, and each element in A p is an action , that is, a potential value for Y p . The collective action...