We shape a formal framework for distinguishing the behaviour of constructive and non-constructive polynomial time approximation algorithms for NP optimization problems. We introduce a new class, called SubNPO, that includes NPO and also some other problems used in recent works.

We draw a rough shape of a general formal framework for polynomial approximation theory which encompasses the existing one by allowing the expression of new types of results. We show how this framework incorporates all the existing approximation results and, moreover, how new types of results...

This paper introduces, within a general equilibrium setting, an alternate theory of value that provides a value-based characterization of the most important notions of allocative equilibria even in cases where the (Walrasian) uniform price-based characterizations need not be applicable. The...