Title

Notes on Computational Complexity of GE Inequalities

Authors

Donald J. Brown

Document Type

Discussion Paper

Publication Date

7-1-2012

CFDP Number

1865

CFDP Pages

13

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.

This document is currently not available here.

Share

COinS