A COMPULSORY SMUGGLING MODEL OF INSPECTION GAME TAKING ACCOUNT OF FULFILLMENT PROBABILITIES OF PLAYERS' AIMS
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with an inspection game of the customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take an action during a limited number of days but only the smuggler cannot discard any opportunity intentionally. When the smuggling coincides with the patrol, there are three possibilities that the customs captures the smuggler, the smuggler makes a success of the smuggling or none of them happens. If the smuggler is captured or there remains no day for playing the game, the game ends. There have been some studies so far on the inspection game. Some consider the cases that the smuggler has only one smuggling or the perfect-capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling players' purposes. However there has been little study in which they discussed the stochastic inspection. In this paper, we formulate the problem into a multi-stage two-person zero-sum stochastic game and investigate some characteristics of its equilibrium solution, some of which are given in closed forms in special cases.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
関連論文
- A MULTI-STAGE SEARCH ALLOCATION GAME WITH THE PAYOFF OF DETECTION PROBABILITY
- AN INSPECTION GAME WITH SMUGGLER'S DECISION ON THE AMOUNT OF CONTRABAND
- AN OPTIMAL INVESTIVATION IN TWO STAGE SEARCH WITH RECOGNITION ERRORS
- DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS
- A CONCAVE MAXIMIZATION PROBLEM WITH DOUBLE LAYERS OF CONSTRAINTS ON THE TOTAL AMOUNT OF RESOURCES
- A SEARCH GAME FOR A MOBILE TARGET WITH THE CONDITIONALLY DETERMINISTIC MOTION DEFINED BY PATHS
- OPTIMAL SEARCH FOR A MOVING TARGET WITH NO TIME INFORMATION MAXIMIZING THE EXPECTED REWARD
- A COMPULSORY SMUGGLING MODEL OF INSPECTION GAME TAKING ACCOUNT OF FULFILLMENT PROBABILITIES OF PLAYERS' AIMS
- OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
- OPTIMAL INVESTIGATING SEARCH MAXIMIZING THE DETECTION PROBABILITY
- A SEARCH GAME WITH REWARD CRITERION
- RANDOMIZED LOOK STRATEGY FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- AN INTEGER RESOURCE ALLOCATION PROBLEM WITH COST CONSTRAINT
- AN APPROXIMATION FOR A CONTINUOUS DATUM SEARCH GAME WITH ENERGY CONSTRAINT
- A SEARCH GAME TAKING ACCOUNT OF LINEAR EFFECTS AND LINEAR CONSTRAINTS OF SEARCHING RESOURCE