Search games on a broken wheel with traveling and search costs
DOI10.15807/JORSJ.60.379zbMATH Open1382.91017OpenAlexW2741456537MaRDI QIDQ4597004FDOQ4597004
Authors: Vic Baston, Kensaku Kikuta
Publication date: 11 December 2017
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.60.379
Recommendations
game theoryoptimal strategytwo-personcyclic networkordering of search of nodessearch and traveling costs
Search theory (90B40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Discrete-time games (91A50)
Cited In (8)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- A search problem on a bipartite network
- Search for an immobile hider in a known subset of a network
- Search games on a network with travelling and search costs
- A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
- Title not available (Why is that?)
- The search and rescue game on a cycle
- A SEARCH GAME WITH TRAVELING COST ON A TREE
This page was built for publication: Search games on a broken wheel with traveling and search costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597004)