This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially...

We analyze information design games between two designers with opposite preferences and a single agent. Before the agent makes a decision, designers repeatedly disclose public information about persistent state parameters. Disclosure continues until no designer wishes to reveal further...

This paper characterizes the class of communication networks for which, in any environment (utilities and beliefs), every incentive-compatible social choice function is (partially) implementable. Among others, in environments with either common and independent beliefs and private values or a bad...

Consider a sender and a receiver as two distant nodes in a network. The sender wishes to transmit a secret to the receiver, but faces an adversary controlling an unknown set of nodes. We characterize the directed networks for which there exist \epilson-secret and \epsilon-strongly secure...

We analyze information design games between two designers with opposite preferences and a single agent. Before the agent makes a decision, designers repeatedly disclose public information about persistent state parameters. Disclosure continues until no designer wishes to reveal further...

We analyze security price formation in a dynamic setting in which long-lived dealers repeatedly compete for trading with short-lived retail traders. We characterize equilibria in which dealers' dynamic pricing strategies are optimal no matter the private information each dealer may possess....