A SEARCH GAME WITH TRAVELING COST ON A TREE

スポンサーリンク

概要

• 論文の詳細を見る

• There is a rooted tree. A person selects a vertex except the root, hides in it and stays there. The searcher is at the root and then examines each vertex until he finds the hider, traveling along edges of the tree. Associated with the examination are a traveling cost dependent on the distance from the last vertex examined and a fixed examination cost. The searcher wishes to minimize the expected cost of finding the hider, whereas the hider wishes to maximize it. The problem is formulated as a two-person zero-sum game and it is solved.

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

著者

• 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

スポンサーリンク