Lion and man—can both win?

被引：0
作者：
B. Bollobás
I. Leader
M. Walters
机构：
[1] University of Cambridge,Department of Pure Mathematics and Mathematical Statistics
[2] University of Memphis,Department of Mathematics
[3] Queen Mary University of London,Department of Mathematics
来源：
Israel Journal of Mathematics | 2012年 / 189卷
关键词：
Winning Strategy; Closed Disc; Full Speed; Closed Unit Disc; Drawing Strategy;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper is concerned with continuous-time pursuit and evasion games. Typically, we have a lion and a man in a metric space: they have the same speed, and the lion wishes to catch the man while the man tries to evade capture. We are interested in questions of the following form: is it the case that exactly one of the man and the lion has a winning strategy?
引用
收藏
页码：267 / 286
页数：19
相关论文
共 7 条
  • [1] Alonso L.(1992)“Lion and man”: upper and lower bounds ORSA Journal on Computing 4 447-452
  • [2] Goldstein A.(1964)Lion and man: a postscript Journal of the London Mathematical Society 39 385-390
  • [3] Reingold E.(1986)The lion and man problem revisited Journal of Optimization Theory and Applications 49 411-430
  • [4] Croft H. T.(1988)Theories of pursuit and evasion Journal of Optimization Theory and Applications 56 271-284
  • [5] Lewin J.(2001)A solution of David Gale’s Lion and Man Problem Theoretical Computer Science 259 663-670
  • [6] Mycielski J.(undefined)undefined undefined undefined undefined-undefined
  • [7] Sgall J.(undefined)undefined undefined undefined undefined-undefined
1