-
- Hohzaki Ryusuke
- National Defense Academy
-
- Iida Koji
- National Defense Academy
書誌事項
- タイトル別名
-
- Search Game with Reward Criterion
この論文をさがす
抄録
This paper investigates a search game of a searcher and a target. At the beginning of the search, the target selects his path from some options and the searcher determines the distribution of his available search resources into a search space which consists of discrete cells and discrete time points. The searcher gains a value on detection of the target while he expends the search cost depending on the allocation of the search resource. The payoff of the search is the expected reward which is defined as the expected value minus the expected search cost. The searcher wants to maximize the expected reward and the target wants to minimize it. We formulate the problem as a two-person zero-sum game and reduce it to a concave maximization problem. We propose a computational method to obtain an optimal solution of the game. Our method proceeds in such a way that one-sided problems generated from the original game are repeatedly solved and their solutions converge asymptotically to an optimal solution of the game. By some examples, we examine the effect of parameters included in the problem upon an optimal solution to elucidate some characteristics of the solution and the computational time of the proposed method.
収録刊行物
-
- 日本オペレーションズ・リサーチ学会論文誌
-
日本オペレーションズ・リサーチ学会論文誌 41 (4), 629-642, 1998
公益社団法人 日本オペレーションズ・リサーチ学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679085862400
-
- NII論文ID
- 110001183864
-
- NII書誌ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL書誌ID
- 4625508
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可