Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded
From MaRDI portal
Publication:1083342
DOI10.1016/0885-064X(85)90015-9zbMath0604.90011MaRDI QIDQ1083342
Thomas Marschak, Leonid Hurwicz
Publication date: 1985
Published in: Journal of Complexity (Search for Journal in Brave)
continuum Walrasian mechanisminformationally efficient privacy-preserving resource allocation mechanismsminimal message-space sizetwo-person, two-commodity linear-quadratic exchange economies
Related Items
The complexity of resource allocation and price mechanisms under bounded rationality, Approximating a function by choosing a covering of its domain and k points from its range, Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games, Network mechanisms, informational efficiency, and hierarchies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decentralized resource allocation and increasing returns
- On the informational size of message spaces
- On the informational size of message spaces for resource allocation processes
- On the Informational Size of Message Spaces for Efficient Resource Allocation Processes
