Abstract An inspection game is a mathematical model of a non‐cooperative situation where an inspector verifies that another party, called inspectee, adheres to legal rules. The inspector wishes to deter illegal activity on the part of the inspectee and, should illegal activity nevertheless take place, detect it with the highest possible probability and as soon as possible. The inspectee may have some incentive to violate his commitments and violation, if observed, will incur punishment. Therefore if he chooses illegal behaviour, the inspectee will wish to avoid detection with the highest possible probability. Three examples of applications are presented. The first one deals with random controls in public transportation systems. The second one describes the problem of verification of arms control and disarmament in a very general way. The third one deals with inspections over time which are important in the context of non‐proliferation verification.
[1]
D. Marc Kilgour,et al.
Site selection for on‐site inspection in arms control
,
1992
.
[2]
Miss A.O. Penney.
(b)
,
1974,
The New Yale Book of Quotations.
[3]
R Avenhaus.
Playing for time: A sequential inspection game
,
2004
.
[4]
Charles B. Davis.
Compliance Quantified: An Introduction to Data Verification
,
1996,
Technometrics.
[5]
Harvey Diamond,et al.
Minimax Policies for Unobservable Inspections
,
1982,
Math. Oper. Res..
[6]
Morton Davis,et al.
APPLICATIONS OF STATISTICAL METHODOLOGY TO ARMS CONTROL AND DISARMAMENT. SECTIONS III AND V.
,
1963
.
[7]
Bernhard von Stengel,et al.
Chapter 51 Inspection games
,
2002
.