The Complexity of Resource Allocation and Price Mechanisms under Bounded Rationality
AbstractWe develop a framework for designing 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 decentralized 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.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoArticle provided by Springer in its journal Economic Theory.
Volume (Year): 6 (1995)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Van Zandt, Timothy, 2003. "Real-Time Hierarchical Resource Allocation with Quadratic Costs," CEPR Discussion Papers 4022, C.E.P.R. Discussion Papers.
- John Rust, 1996. "Dealing with the Complexity of Economic Calculations," Computational Economics 9610002, EconWPA, revised 21 Oct 1997.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.