Show simple item record

dc.contributor.authorFilar, Jerzy A
dc.date.accessioned2012-09-14T00:25:55Z
dc.date.available2012-09-14T00:25:55Z
dc.date.issued1985
dc.identifier.citationFilar, J.A. 1985. Player aggregation in the traveling inspector model. IEEE Transactions on Automatic Control, vol. AC-30(8), 723-729.en
dc.identifier.issn0018-9286
dc.identifier.urihttp://hdl.handle.net/2328/26283
dc.description.abstractWe consider a model of dynamic inspection/surveillance of a number of facilities in different geographical locations. The inspector in this process travels from one facility to another and performs an inspection at each facility he visits. His aim is to devise an inspection/ travel schedule which minimizes the losses to society (or to his employer) resulting both from undetected violations of the regulations and from the costs of the policing operation. This model is formulated as a non-cooperative, single-controller, stochastic game. The existence of stationary Nash equilibria is established as a consequence of aggregating all the inspectees into a single “aggregated inspectee”. It is shown that such player aggregation causes no loss of generality under very mild assumptions. A notion of an “optimal Nash equilibrium” for the inspector is introduced and proven to be well-defined in this context. The issue of the inspector’s power to “enforce” such an equilibrium is also discussed.en
dc.language.isoen
dc.publisherInstitute of Electrical and Electronic Engineersen
dc.subjectMathematicsen
dc.subjectGame theoryen
dc.titlePlayer aggregation in the traveling inspector modelen
dc.typeArticleen
dc.rights.licenseIn Copyright


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record