We study a discounted repeated inspection game with two agents and one principal. Both agents may profit by violating certain rules, while the principal can inspect on at most one agent in each period, inflicting a punishment on an agent who is caught violating the rules. The goal of the principal is to minimize the discounted number of violations, and he has a Stackelberg leader advantage. We characterize the principal's optimal inspection strategy.
|Optimal Dynamic Inspection.pdf||628 KB|