Optimal Selection of Observation Times in a Costly Information Game
暂无分享,去创建一个
Pursuit evasion games with costly and asymmetric information are studied. It is supposed that the evader has perfect information about the position of the pursuer (and himself) at each instant of time whereas the pursuer gets information about the position of the evader only at discrete instants. Furthermore we suppose that the pursuer cannot move during a given period of time while he gathers this information. We investigate both the case in which the instants of observation are chosen by the pursuer in an open loop way (at the beginning of the game) and the case in which he chooses these instants according to the last information obtained (i.e., he chooses in a feedback way).
[1] Jean-Marie Nicolas,et al. About the resolution of discrete pursuit games and its applications to naval warfare , 1991 .
[2] Harri Ehtamo,et al. Differential Games — Developments in Modelling and Computation , 1991 .
[3] D. Luenberger. Optimization by Vector Space Methods , 1968 .
[4] A. A. Melikian. On minimal observations in a game of encounter: PMM vol. 37, n≗3, 1973, pp. 426–433 , 1973 .
[5] Odile Pourtallier,et al. Pursuit evasion game with costly information , 1994 .