Finding a moving fugitive. A game theoretic representation of search

DOI10.1016/J.COR.2006.09.020zbMath1140.91029OpenAlexW2088351107MaRDI QIDQ2462540

Gordon H. McCormick, Guillermo Owen

Publication date: 30 November 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.020

zbMATH Keywords

search gamesMarkov processFrobenius eigenvector

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Other game-theoretic models (91A40)

Related Items (4)

A foraging problem: sit-and-wait versus active predation ⋮ A composite game of hide and seek ⋮ A class of two-person zero-sum matrix games with rough payoffs ⋮ Static search games played over graphs and general metric spaces

Cites Work

• Unnamed Item
• Search for an Avoiding Target
• The search value of a network
• Ambush Strategies in Search Games on Graphs
• A SEQUENTIAL EVASION-SEARCH GAME WITH A GOAL
• Search-Evasion Game in a Fixed Region
• Dynamic Search Games
• Search Games with Mobile and Immobile Hider
• Differential Search Games with Mobile Hider
• The Robot and the Rabbit--A Pursuit Problem
• Some Results on Max-Min Pursuit

This page was built for publication: Finding a moving fugitive. A game theoretic representation of search