A lower bound on computational complexity given by revelation mechanisms

Author:

Mount Kenneth R.,Reiter Stanley

Publisher

Springer Science and Business Media LLC

Subject

Economics and Econometrics

Reference30 articles.

1. Abelson, H.: Lower bounds on information transfer in distributed computations. JACM27, 384–392 (1980)

2. Arbib, M. A.: Theories of abstract automata. Englewood Cliff, New Jersey: Prentice Hall, Inc. 1969

3. Chen, P.: A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal. J. Math. Econ.21, 249–270 (1992)

4. Golubitsky, M., Guillemin, V.: Stable mappings and their singularities. In: Graduate texts in mathematics No. 14. New York: Springer 1973

5. Hurwicz, L.: On informational decentralization and efficiency in resource allocation mechanisms. In: Reiter, S. (ed.) Studies in mathematical economics, Vol. 25. The Mathematical Association of America, 1986

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Computational implementation;Review of Economic Design;2022-01-08

2. Simple Social Choice Rules for Exchange;SSRN Electronic Journal;2021

3. Communication in Mechanism Design;2008

4. Chapter 4 Organization Structure;Handbooks in Information Systems;2006

5. Real-Time Decentralized Information Processing as a Model of Organizations with Boundedly Rational Agents;Review of Economic Studies;1999-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3