A HIDE AND SEEK GAME WITH TRAVELING COST

スポンサーリンク

概要

• 論文の詳細を見る

• There are n, neighboring cells in a straight line. A man hides among one of all cells and stays there. The searcher examines each cell until he finds the hider. Associated with the examination by the searcher are a traveling cost dependent on the distance from the last cell examined and a fixed examination cost. The searcher wishes to minimize the expectation of cost of finding the hider. On the other hand the hider wishes to maximize it. This is formulated as a two-person zero-sum game and it is solved.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kikuta Kensaku

  Faculty Of Economics Toyama University

• Kikuta Kensaku

  Faculty of Economics, Toyama University

関連論文

• A SEARCH GAME WITH TRAVELING COST ON A TREE
• AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
• A HIDE AND SEEK GAME WITH TRAVELING COST
• A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
• A SEARCH GAME WITH TRAVELING COST

スポンサーリンク