The Revelation Principle
Mechanism design is a framework for studying the set of implementable outcomes when rational agents have private information. Revelation principle is one of its key lemmas. Here’s a principled way to understand it: Setup Agents: $i \in [n] = \{1, \dots, n\}$. Types: Each agent $i$ has private type $t_i \in T_i$. The joint type space is $T = \prod_{i=1}^n T_i$. Prior: The type distribution (common prior) is $q \in \Delta(T)$. Assume $q$ is fully supported on $T$, i.e., $q(t) > 0$ for all $t \in T$. Outcomes: $x \in X$. Preferences: Each agent $i$ has a VNM utility function contingent on the outcome and the types of all agents: $$u_i : X \times T \to \mathbb{R}.$$ General Mechanism Definition. A (general) mechanism is a pair $(S, g)$, where $S = S_1 \times \cdots \times S_n$, with $S_i$ the set of strategies (messages) available to agent $i$, and $g$ is a (possibly stochastic) outcome function: ...