A lower bound on computational complexity given by revelation mechanisms

• 1 March 1996
• journal article
• Published by Springer Nature in Economic Theory
• Vol. 7  (2) , 237-266
• https://doi.org/10.1007/s001990050051

Abstract

Keywords

• COMPUTATIONAL COMPLEXITY
• COMPUTATIONAL COST
• SMOOTH FUNCTION
• ECONOMIC THEORY
• SMOOTH MANIFOLD

All Related Versions

• Version 1, RePEc (Unconfirmed version)