A lower bound on computational complexity given by revelation mechanisms

Publisher Website

1 March 1996

journal article
Published by Springer Nature in Economic Theory

Vol. 7 (2), 237-266
https://doi.org/10.1007/s001990050051

Abstract

No abstract available

All Related Versions

Version 1, RePEc (Unconfirmed version)

Cited by 1 article