Notes on Computational Complexity of GE Inequalities

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.

MoreLess

Year of publication:	2012-07
Authors:	Brown, Donald J.
Institutions:	Cowles Foundation for Research in Economics, Yale University
Subject:	General equilibrium inequalities \| Computational complexity

More details

Extent:	application/pdf
Series:	Cowles Foundation Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The price is None Number 1865 13 pages
Classification:	D51 - Exchange and Production Economies ; D58 - Computable and Other Applied General Equilibrium Models
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010895684