THE COMPLEXITY OF RESOURCE-ALLOCATION AND PRICE MECHANISMS UNDER BOUNDED RATIONALITY

We develop a framework for desgining and evaluating the complexity of mechanisms that allocate resources in a distributed setting to agents or processors with bounded computational ability. We discuss several mechanisms and describe the construction of efficient price based mechanisms, which exploit the decentrlized aspects of the problem. These price mechanisms are polynomial in the number of resources, precision of the solution, and the logarithm of the number of agents.