Beyond Hurwicz: Incentive Compatibility under Informational Decentralization
David Lancashire
TL;DR
The paper addresses incentive compatibility in informationally decentralized environments and shows Hurwicz impossibility is conditional. It introduces a narrow class of non-revelation-equivalent indirect mechanisms with parallel enforcement regimes and non-scalar messages, where enforcement costs are generated endogenously. It develops a layered taxonomy of Myerson and Non-Myerson layers, adds selective disclosure across privacy walls, and formalizes trust as an unparameterizable variable leading to Gödel-type unrepresentability; using $S$, $K(S)$, and $R(S,\tau)$, it shows the optimal $S^*(\tau)$ decreases with $\tau$ and that direct elicitation of $\tau$ is impossible. The results broaden mechanism design beyond the Revelation Principle and have practical implications for decentralized protocols and consensus systems.
Abstract
Achieving incentive compatibility under informational decentralization is impossible within the class of direct and revelation-equivalent mechanisms typically studied in economics and computer science. We show that these impossibility results are conditional by identifying a narrow class of non-revelation-equivalent mechanisms that sustain enforcement by inferring preferences indirectly through parallel, uncorrelatable games.
