Download This PaperNotes on Computational Complexity of GE Inequalities
14 Pages Posted: 9 Jul 2012
There are 2 versions of this paper
Notes on Computational Complexity of GE Inequalities
Cowles Foundation Discussion Paper No. 1865
Number of pages: 14
Posted: 09 Jul 2012
You are currently viewing this paper
Downloads
35
Notes on Computational Complexity of GE Inequalities
Cowles Foundation Discussion Paper No. 1865R
Number of pages: 19
Posted: 23 Aug 2012
Downloads
29
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: 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
Do you have a job opening that you would like to promote on SSRN?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.