We study information design with multiple privately informed agents who interact in a game. Each agent's utility is linear in a real-valued state. We show that there always exists an optimal mechanism which is laminar partitional and bound its ``complexity''. For each type profile, such a...

We study information design with multiple privately informed agents who interact in a game. Each agent's utility is linear in a real-valued state. We show that there always exists an optimal mechanism that is laminar partitional and bound its “complexity.” For each type profile, such a...