A lower bound on computational complexity given by revelation mechanisms
type: Item
instance of: scholarly article
title: A lower bound on computational complexity given by revelation mechanisms
zbMATH Open document ID: 0854.68045
DOI: 10.1007/BF01213904
author: Stanley Reiter
author: Kenneth R. Mount
published in: Economic Theory
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91B50
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 913877
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
cites work: Lower Bounds on Information Transfer in Distributed Computations
cites work: Q5588674
cites work: A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal
cites work: Q4046802
cites work: Q3745572
cites work: Q5668220
cites work: The competitive allocation process is informationally efficient uniquely
cites work: Finite Rationality and Interpersonal Complexity in Repeated Games
cites work: A note on the interrelation of subsets of independent variables of a continuous function with continuous first derivatives
cites work: Q5639839
cites work: Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
cites work: Incentive compatibility and informational requirements
cites work: Game Forms with Minimal Message Spaces
cites work: Decentralized dynamic processes for finding equilibrium
cites work: Finite automata play the repeated prisoner's dilemma
cites work: Effective Price Mechanisms
cites work: Q5341863
cites work: An Axiomatic Characterization of the Price Mechanism
cites work: Q5794747
cites work: Necessary and sufficient conditions for the existence of a locally stable message process
description: scientific article; zbMATH DE number 913877