A Multi-Stage Model of Searching for Two Mobile Objects on a Graph

DOI10.1007/978-3-030-39789-0_5zbMATH Open1448.91064OpenAlexW3035032728MaRDI QIDQ5118428FDOQ5118428

Authors: V. V. Gusev 

Publication date: 8 September 2020

Published in: Annals of the International Society of Dynamic Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-39789-0_5

Recommendations

• A stochastic model for optimization of search for moving objects
• Search for a moving target in a graph
• Dynamic graph-based search in unknown environments
• Investigating the benefits of re-optimisation while searching for two immobile entities on a network
• scientific article; zbMATH DE number 1151792
• A combinatorial model of two-sided search
• A Combinatorial Model of Two-Sided Search
• scientific article; zbMATH DE number 999622
• Using multiple searchers in constrained-path, moving-target search problems

zbMATH Keywords

game theorysearch theorydynamic searchsearch modelmulti-stage gamesearch on graph

Mathematics Subject Classification ID

Search theory (90B40) Multistage and repeated games (91A20) Games involving graphs (91A43)

Cites Work

• Hide-and-Seek Games on a Network, Using Combinatorial Search Paths
• A cooperative game in search theory
• Search games: literature and survey
• SEARCH GAMES ON A BROKEN WHEEL WITH TRAVELING AND SEARCH COSTS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A MULTI-STAGE SEARCH ALLOCATION GAME WITH THE PAYOFF OF DETECTION PROBABILITY
• A nonlinear model of a search allocation game with false contacts

Cited In (1)

• Multi-objective search game: long-term vs short-term

This page was built for publication: A Multi-Stage Model of Searching for Two Mobile Objects on a Graph

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