The complexity of resource allocation and price mechanisms under bounded rationality

DOI10.1007/BF01212489zbMath0831.90051MaRDI QIDQ1896683

Shmuel S. Oren, Eric J. Friedman

Publication date: 25 February 1996

Published in: Economic Theory (Search for Journal in Brave)

zbMATH Keywords

resource allocation; mechanisms; processors with bounded computational ability

Mathematics Subject Classification ID

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem, Network Utility Maximization by Updating Individual Transmission Rates, Composite optimization for the resource allocation problem, Dual subgradient method with averaging for optimal resource allocation, Numerical methods for the resource allocation problem in a computer network

Cites Work

• Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded
• A convergent process of price adjustment and global Newton methods
• An ellipsoid algorithm for nonlinear programming
• The Organization of Decentralized Information Processing
• Some Examples of Global Instability of the Competitive Equilibrium
• Stability of the Gradient Process in n-Person Games
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• A private good/public good decomposition for optimal flow control of an<tex>M/M/1</tex>queue
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item