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

An Evasion Game on a Finite Tree

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

DOI10.1137/0328039zbMATH Open0726.90107OpenAlexW2083546530MaRDI QIDQ3348748FDOQ3348748

F. A. Bostock, Victor J. Baston

Publication date: 1990

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0328039



zbMATH Keywords

tree\(\epsilon \) -optimal strategymixed positional strategiesrecursive matrix gametime lag system


Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)



Cited In (7)

  • Title not available (Why is that?)
  • Accumulation games. I: Noisy search
  • The tree search game for two players
  • On a discrete evasion game of Isaacs
  • Trees and Ehrenfeucht-Fraïssé games
  • On the Cookie-Cutter Game: Search and Evasion on a Disc
  • Title not available (Why is that?)


   Recommendations
  • An Evasion Game with Barriers 👍 👎
  • Title not available (Why is that?) 👍 👎
  • An Evasion Game with an Infinite Number of States 👍 👎
  • A SEQUENTIAL EVASION-SEARCH GAME WITH A GOAL 👍 👎
  • An evasion game on a graph 👍 👎





This page was built for publication: An Evasion Game on a Finite Tree

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

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