Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The Robot and the Rabbit--A Pursuit Problem

From MaRDI portal
Publication:5573002
Jump to:navigation, search

DOI10.2307/2317260zbMATH Open0181.47201OpenAlexW4241829100MaRDI QIDQ5573002FDOQ5573002


Authors: Benjamin Halpern Edit this on Wikidata


Publication date: 1969

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2317260





zbMATH Keywords

operations research



Cited In (5)

  • Simultaneous orthogonal collocation decomposition method for extended \textit{Lion and Man} problems
  • A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man game
  • Bounds for cops and robber pursuit
  • A composite game of hide and seek
  • Finding a moving fugitive. A game theoretic representation of search





This page was built for publication: The Robot and the Rabbit--A Pursuit Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573002)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5573002&oldid=30192154"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:41. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki