Arbeitspapier
A Lower Bound on Computational Complexity Given by Revelation Mechanisms
This paper establishes an elementary lower bound on the computational complexity of smooth functions between Euclidean spaces(actually, smooth manifolds). The main motivation for this comes from mechanism design theory. The complexity of computations required by a mechanism determines an element of the costs associated with that mechanism. The lower bound presented in this paper is useful in part because it does not require specification in detail of the computations to be performed by the mechanism, but depends only on the goal function that the mechanism is to realize or implement.
- Language
-
Englisch
- Bibliographic citation
-
Series: Discussion Paper ; No. 1085
- Classification
-
Wirtschaft
- Event
-
Geistige Schöpfung
- (who)
-
Mount, Kenneth R.
Reiter, Stanley
- Event
-
Veröffentlichung
- (who)
-
Northwestern University, Kellogg School of Management, Center for Mathematical Studies in Economics and Management Science
- (where)
-
Evanston, IL
- (when)
-
1994
- Handle
- Last update
-
10.03.2025, 11:43 AM CET
Data provider
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Mount, Kenneth R.
- Reiter, Stanley
- Northwestern University, Kellogg School of Management, Center for Mathematical Studies in Economics and Management Science
Time of origin
- 1994