A SEQUENTIAL ALLOCATION PROBLEM WITH SEARCH COST WHERE THE SHOOT-LOOK -SHOOT POLICY IS EMPLOYED

スポンサーリンク

概要

• 論文の詳細を見る

• Suppose a hunter starts hunting over t periods with i bullets. A distribution of the value of targets appearing and the hitting probability of a bullet are known. For shooting, he takes a strategy of a shoot-look-shoot scheme. The objective in this paper is to find an optimal policy which maximizes the total expected reward. In the case with no search cost, the optimal policy is monotone in the number of bullets remaining then, but not always monotone in the case with positive search cost. We show such examples of non-monotonicity and examine conditions for the monotonicity of the optimal policy.

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

著者

• Sato M

  Univ. Tsukuba

• Sato Masahiro

  Doctoral Program in Policy and Planning Sciences University of Tsukuba

関連論文

• A SEQUENTIAL ALLOCATION PROBLEM WITH SEARCH COST WHERE THE SHOOT-LOOK -SHOOT POLICY IS EMPLOYED

スポンサーリンク