“…In fact, the recent studies by Halac, Lipnowski, and Rappoport (2021) and Moriya and Yamashita (2020), who considered the optimal joint design of transfers and information and showed how the “divide‐and‐conquer” incentive schemes (Segal (2003)) in the model of Winter (2004) can be improved upon by introducing higher order payoff uncertainty, can be understood from this viewpoint. In particular, the optimization problem of Halac, Lipnowski, and Rappoport (2021) can be equivalently rewritten as a problem with the constraint that “all participating” is limit S‐ (hence fully) implementable, which is characterized by our sequential obedience condition—a stochastic version of “divide‐and‐conquer.” In Morris, Oyama, and Takahashi (2022b), we formally describe the above solution method. By appealing also to the fact that their model has a potential, we obtain additional insights over Halac, Lipnowski, and Rappoport (2021).…”