Summary
In this note we introduce a model of a dynamic inspection process which we call “The Traveling Inspector Model.” The problem is formulated as a single-controller, zero-sum, undiscounted stochastic game, with some special structure. This structure ensures that the game is solvable by a relatively simple linear program.
Zusammenfassung
In dieser Arbeit betrachten wir ein Modell eines dynamischen Inspektionsprozesses, das wir “Traveling-Inspector-Modell” nennen. Das Problem wird formuliert als ein speziell strukturiertes stochastisches Zweipersonen-Nullsummenspiel, bei dem ein Spieler das Übergangsgesetz bestimmt. Wegen der speziellen Struktur kann das Problem mithilfe eines relativ einfachen linearen Programms gelöst werden.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Filar JA (1985) Player aggregation in the traveling inspector model. IEEE AC-30, 8:723–729
Filar JA, Schultz TA (1983) Interactive solutions for the traveling inspector model and related problems. Operations Research Group Report 83-06, The Johns Hopkins University, Baltimore, MD, USA
Hordijk A, Kallenberg LCM (1981) Linear programming and Markov games I and II. In: Moeschlin O, Pallaschke D (eds) Game theory and mathematical economics. North-Holland, Amsterdam, pp 291–320
Sobel MJ (1981) Myopic solutions of Markov decision processes and stochastic games. Oper Res 29:995 -1009
Vrieze OJ (1981) Linear programming and undiscounted stochastic games in which one player controls transitions. OR Spektrum 3:29–35
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Filar, J.A., Schultz, T.A. The traveling inspector model. OR Spektrum 8, 33–36 (1986). https://doi.org/10.1007/BF01720770
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01720770