Notes on Computational Complexity of GE Inequalities

14 Pages Posted: 9 Jul 2012

See all articles by Donald Brown

Donald Brown

Yale University - Cowles Foundation

Multiple version iconThere are 2 versions of this paper

Date Written: July 9, 2012

Abstract

Recently, Cheryche et al. (2011) proved the important negative result that deciding the strong feasibility of the Marshallian equilibrium inequalities, introduced by Brown and Matzkin (1996), is NP-complete. Here, I show that the weak feasibility of the equivalent Hicksian equilibrium inequalities, introduced by Brown and Shannon (2000), can be decided in oracle-polynomial time.

Keywords: General equilibrium inequalities, Computational complexity

JEL Classification: D510, D580

Suggested Citation

Brown, Donald J., Notes on Computational Complexity of GE Inequalities (July 9, 2012). Cowles Foundation Discussion Paper No. 1865, Available at SSRN: https://ssrn.com/abstract=2102578 or http://dx.doi.org/10.2139/ssrn.2102578

Donald J. Brown (Contact Author)

Yale University - Cowles Foundation ( email )

Box 208281
New Haven, CT 06520-8281
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
35
Abstract Views
412
PlumX Metrics