On online platforms, goods, services, and content providers, also known as agents, introduce adverse events. The frequency of these events depends on each agent’s effort level. In “Efficient Resource Allocation Contracts to Reduce Adverse Events,” Liang, Sun, Tang, and Zhang study continuous-time dynamic contracts that utilize resource allocation and monetary transfers to induce agents to exert effort and reduce the arrival rate of adverse events. They devise an iterative algorithm that characterizes and calculates such contracts and specify the profit-maximizing contract for the platform, also known as the principal. In contrast to the single-agent case, in which efficiency is not achievable, they show that efficient and incentive-compatible contracts, which allocate all resources and induce agents to exert constant effort, generally exist with two or more agents. Additionally, they also provide efficient and incentive-compatible dynamic contracts that can be expressed in closed form and are therefore easy to understand and implement in practice.