AN INSPECTION GAME WITH SMUGGLER'S DECISION ON THE AMOUNT OF CONTRABAND
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with an inspection game of Customs and a smuggler. Customs has two options: patrol or no-patrol. The smuggler makes a decision on the amount of contraband to smuggle. In a given period of days, Customs has a limited number of opportunities to patrol while the smuggler can ship any amount of contraband as long as he has not exhausted this supply. When both players take action, there are some possibilities that Customs captures the smuggler and there are also possibilities that the smuggler is successful. If the smuggler is captured or there remains no day for playing the game, the game ends. In this paper, we formulate the problem as a multi-stage two-person zero-sum stochastic game, derive a closed form of equilibrium in a specific case and investigate the properties of the optimal strategies for the players. Nearly all past research has studied the smuggler's strategy with the two choices of smuggling or no-smuggling. This paper focuses on the smuggler's decision as to the amount of contraband.
著者
関連論文
- 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