An inspection game with multiple inspectees

This paper deals with a non-zero-sum inspection game with one inspector and several inspectees. Each inspectee country makes a decision from the standpoint of his national interest while the inspector distributes staff to inspectee facilities to detect illegal behavior. We propose a method to find a Nash equilibrium for the game, which could help the inspector make an effective plan about how to assign staff to individual suspect facilities in those countries. Avenhaus et al. studied this kind of two-inspectee model. This paper extends Avenhaus' research to a multi-inspectee model taking account of optimal dispatching of inspection staff.