Skip to main content
Discussion Paper

Computational Complexity of the Walrasian Equilibrium Inequalities

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 Walrasian equilibrium inequalities as the Hicksian equilibrium inequalities.