Escaping an Infinitude of Lions
arXiv:2012.11181v24 citations
AI Analysis
This work solves a long-standing open problem in pursuit-evasion theory, which is significant for mathematicians and game theorists.
This paper addresses a pursuit-evasion game in the Euclidean plane where a man with speed 1+ε is pursued by a countable set of unit-speed lions. The authors prove that the man can survive indefinitely for any ε > 0.
We consider the following game played in the Euclidean plane: There is any countable set of unit speed lions and one fast man who can run with speed $1+\varepsilon$ for some value $\varepsilon>0$. Can the man survive? We answer the question in the affirmative for any $\varepsilon>0$.