Skip to search formSkip to main contentSkip to account menu

Search game

Known as: Search games 
A search game is a two-person zero-sum game which takes place in a set called the search space. The searcher can choose any continuous trajectory… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially… 
2008
2008
In the (zero-sum) search game Γ(G, x) proposed by Isaacs, the Hider picks a point H in the network G and the Searcher picks a… 
2007
2007
3 Treewidth 12 3.1 Definition and basic properties . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Recursively defined… 
2005
2005
We call a network partly Eulerian if consists of a tree (of length a and radius r) to which a nite number of disjoint Eulerian… 
2002
2002
This paper deals with the tactical planning of the search efforts for a moving target. It refers deeply to the work of Brown… 
2002
2002
Inter-domain Traffic Engineering (TE) capabilities can significantly improve end-to-end network performance by allowing an ISP to… 
1988
1988
Abstract : This thesis examines a two-person zero sum game where a submarine, after revealing his position by causing a flaming… 
Review
1982
Review
1982
The \alpha-beta" algorithm forms the basis of many programs that search game trees. A number of methods have been designed to… 
1973
1973
NUMBER 4 A target hides himself in one of the boxes 1,2, ... , m with probability distribution X=<Xl, ... , Xm) and can move to…