Cited in
(12)- Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded
- The competitive allocation process is informationally efficient uniquely
- On the size of the message space under non-convexities
- On the informational size of message spaces for resource allocation processes
- Network mechanisms, informational efficiency, and hierarchies
- An infinite dimensional extension of the theory of decentralized mechanisms
- On informational efficiency and incentive aspects of generalized ratio equilibria
- A solution to the problem of consumption externalities.
- The communication requirements of efficient allocations and supporting prices
- The unique informational efficiency of the competitive mechanism in economies with production
- A method for constructing message systems for smooth performance functions
- Incentive compatibility and informational requirements
This page was built for publication: On the informational size of message spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248451)