A method for constructing message systems for smooth performance functions

DOI10.1016/0022-0531(84)90089-9MaRDI QIDQ792208zbMATH OpenOpenAlexFDO

Authors Donald G. Saari

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0022-0531(84)90089-9

zbMATH Keywords

allocation functionimpossibility theoremsmessage networkssmooth performance functions

Mathematics Subject Classification ID

Trade models (91B60)

Recommendations

• Game Forms with Minimal Message Spaces
• Incentive compatibility and informational requirements
• Realization and Nash Implementation: Two Aspects of Mechanism Design
• scientific article; zbMATH DE number 3980852
• Implementing a generic smooth function

Cites work

• Elliptic Partial Differential Equations of Second Order
• scientific article; zbMATH DE number 3215724 (Why is no real title available?)
• scientific article; zbMATH DE number 3321872 (Why is no real title available?)
• On the informational size of message spaces
• On the informational size of message spaces for resource allocation processes

Cited in

(9)

• The representation problem and the efficiency of the price mechanism
• On the local convergence of economic mechanisms
• On the types of information and mechanism design
• A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal
• On the communication complexity of expected-profit maximization
• Constructing regular variables in message passing systems
• Computational implementation
• A necessary condition for decentralization and an application to intertemporal allocation
• On the design of complex organizations and distributive algorithms

This page was built for publication: A method for constructing message systems for smooth performance functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792208)