Notes on Computational Complexity of GE Inequalities

Donald J. Brown ()
Additional contact information
Donald J. Brown: Dept. of Economics, Yale University, https://economics.yale.edu/people/emeritus/donald-j-brown

No 1865, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

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 (search for similar items in EconPapers)
JEL-codes: D51 D58 (search for similar items in EconPapers)
Pages: 13 pages
Date: 2012-07
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d18/d1865.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cwl:cwldpp:1865

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().