Numerical construction of the information set and sufficient conditions for k-detection in the simple search game on the plane

DOI10.25587/SVFU.2017.2.9243zbMATH Open1413.91018OpenAlexW2782910885MaRDI QIDQ4553583FDOQ4553583

Authors: Semyon V. Mestnikov, Nikolay V. Petrov 

Publication date: 30 October 2018

Published in: Журнал «Математические заметки СВФУ» (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.25587/svfu.2017.2.9243

Recommendations

• scientific article; zbMATH DE number 2097239
• scientific article; zbMATH DE number 1991074
• scientific article; zbMATH DE number 6135406
• Search strategies in the game with a team of pursuers and one evader on the plane
• scientific article; zbMATH DE number 1431606

zbMATH Keywords

information setmixed strategydifferential search game

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cited In (4)

• A problem of dynamic search on a plane with simple dynamics for the evader
• Information sets in problems of dynamic search for objects with several participants
• Search strategies in the game with a team of pursuers and one evader on the plane
• Simple search games on an infinite circular cylinder

This page was built for publication: Numerical construction of the information set and sufficient conditions for \(k\)-detection in the simple search game on the plane

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