A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal
From MaRDI portal
Publication:1198384
DOI10.1016/0304-4068(92)90004-QzbMath0765.90031MaRDI QIDQ1198384
Publication date: 16 January 1993
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
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
This page was built for publication: A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal