Recently Cherchye et al. (2011) reformulated the Walrasian equilibrium inequalities, introduced by Brown and Matzkin (1996), as an integer programming problem and proved that solving the Walrasian equilibrium inequalities is NP-hard. Following Brown and Shannon (2000), we reformulate the...

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...

We propose a nonparametric test for multiple calibration of numerical general equilibrium models, and we present an effective algorithm for computing counterfactual equilibria in homothetic Walrasian economies, where counterfactual equilibria are solutions to the Walrasian inequalities.

We propose two algorithms for deciding if the Walrasian equilibrium 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...

Irving Fisher's Ph.D. thesis, submitted to Yale University in 1891, contains a fully articulated general equilibrium model presented with the broad scope and formal mathematical clarity associated with Walras and his successors. In addition, Fisher presents a remarkable hydraulic apparatus for...

Let A be a fixed integer matrix of size m by n and consider all b for which the body is full dimensional. We examine the set of shortest non-zero integral vectors with respect to the family of norms. We show that the number of such shortest vectors is polynomial in the bit size of A, for fixed...

It is suggested that the appropriate structure for the reconciliation of micro and macroeconomics is an infinite horizon overlapping generations (OLG) model with many finitely lived natural persons and one infinitely lived strategic player without preferences whose choice rule is determined by...

Afriat's original method of proof is restored by using the minmax theorem.

We consider the n-player houseswapping game of Shapley-Scarf (1974), with indifferences in preferences allowed. It is well-known that the strict core of such a game may be empty, single-valued, or multivalued. We define a condition on such games called "segmentability", which means that the set...

We comment on the relation between models of information based on signals/partitions, and those based on sigma-algebras. We show that more informative signals need not generate finer sigma-algebras, hence that Blackwell's theorem fails if information is modeled as sigma-algebras. The reason is...