Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal

From MaRDI portal
Publication:1198384
Jump to:navigation, search

DOI10.1016/0304-4068(92)90004-QzbMath0765.90031MaRDI QIDQ1198384

Pengyuan Chen

Publication date: 16 January 1993

Published in: Journal of Mathematical Economics (Search for Journal in Brave)


zbMATH Keywords

decentralized economic mechanismdimension of the message space


Mathematics Subject Classification ID

Economics of information (91B44)


Related Items (2)

A lower bound on computational complexity given by revelation mechanisms ⋮ The communication complexity of computing differentiable functions in a multicomputer network



Cites Work

  • A method for constructing message systems for smooth performance functions
  • On the informational size of message spaces for resource allocation processes
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1198384&oldid=13259299"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki