Mathematical Analysis of Optimal Decision-Making for Search Problems on Finite Graphs
Project/Area Number |
20510139
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Social systems engineering/Safety system
|
Research Institution | University of Hyogo |
Principal Investigator |
KIKUTA Kensaku University of Hyogo, 経営学部, 教授 (30126487)
|
Co-Investigator(Kenkyū-buntansha) |
KINIWA Jun 兵庫県立大学, 経済学部, 教授 (90177882)
|
Project Period (FY) |
2008 – 2010
|
Project Status |
Completed (Fiscal Year 2010)
|
Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2010: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2009: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2008: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
Keywords | 探索理論 / 最適戦略 / ゼロ和ゲーム / システム工学 / ネットワーク / 数理工学 / モデル化 / ゲーム理論 |
Research Abstract |
We considered the basics of the mathematics for elucidation of optimal search and optimal management about the various kinds of search problems and the allied issues on a finite graph and we studied the mathematics of the security management of the network. We showed that the analysis of the model whom an infiltrator owned the width in an ambush game returns to the analysis of the model in the precedent study in which an infiltrator did not have width. We got the necessary condition that an optimal strategy should have satisfied of the explorer of a search problem with investigation expense and the movement expense.
|
Report
(4 results)
Research Products
(47 results)