A multistage game with incomplete information requiring an infinite memory |
| |
Authors: | J. L. Burrow |
| |
Affiliation: | (1) Agricultural Engineering Section, University of Melbourne, Victoria, Australia |
| |
Abstract: | This paper describes a zero-sum, discrete, multistage, time-lag game in which, for one player, there is no integerk such that an optimal strategy, for a new move during play, can always be determined as a function of the pastk state positions; that is, the player requires an infinite memory. The game is a pursuit-evasion game with the payoff to the maximizing player being the time to capture.This paper is the result of work carried out at the University of Adelaide, Adelaide, Australia, under an Australian Commonwealth Postgraduate Award.The author should like to thank the referee for his valued suggestions. |
| |
Keywords: | Multistage discrete games incomplete information infinite memory zero-sum games |
本文献已被 SpringerLink 等数据库收录! |
|