![](/img/cover-not-exists.png)
A Lower Bound on Computational Complexity Given by Revelation Mechanisms
Kenneth R. Mount and Stanley ReiterVolume:
7
Language:
english
Journal:
Economic Theory
DOI:
10.2307/25054919
Date:
February, 1996
File:
PDF, 2.94 MB
english, 1996