Results 1 
3 of
3
An approximation for a continuous datum search game with energy constraint
 Journal of the Operations Research Society of Japan
, 2003
"... Abstract This paper deals with a datum search game, where a target reveals his position (datum point) at a certain time (datum time) and a pursuer begins the search for the target by distributing his searching effort some time later. The target might move in the diffusive fashion from the datum poin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract This paper deals with a datum search game, where a target reveals his position (datum point) at a certain time (datum time) and a pursuer begins the search for the target by distributing his searching effort some time later. The target might move in the diffusive fashion from the datum point to evade his pursuer. His motion is restricted by its continuity in a twodimensional space and constraints on its energy and maximum speed. The pursuer distributes searching effort to detect the evader under constraints on the amount of effort. A payoff is assumed to be the summation of searching effort weighted by the probability distribution of the target. In the previous paper, we formulated the problem as a singlestage twoperson zerosum game on continuous space and continuous time and proposed an upper bound and a lower bound for the value of the game. This paper extends the result and proposes an approximation for the value, noting that a constantspeed motion is crucial for the target.
DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS
, 2001
"... Abstract This paper deals with a search game. In a search space, a target wants to avoid a searcher by selecting his path. The searcher has superior mobility and makes effort to detect the target by distributing divisible searching effort anywhere he wants. The target might move diffusively from the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract This paper deals with a search game. In a search space, a target wants to avoid a searcher by selecting his path. The searcher has superior mobility and makes effort to detect the target by distributing divisible searching effort anywhere he wants. The target might move diffusively from the starting points but his motion is restricted by some constraints on his maximum speed and energy consumption. The searcher also has limits on the total amount of searching effort. A payoff of the game is assumed to be the detection probability of the target, which is represented by an exponential function of the cumulative searching effort weighted by the probability distribution of the target. Regardless of the payoff function, we name the game the search allocation game with energy constraints. We formulate it as a twoperson zerosum game and propose a linear programming method to solve it. Our formulation and method have the flexibility to be applied to other search models by a small modification. 1.
A MULTISTAGE SEARCH ALLOCATION GAME WITH THE PAYOFF OF DETECTION PROBABILITY
, 2005
"... Abstract This paper deals with a multistage twoperson zerosum game called the multistage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher distributes his searching resources in a discrete search space to detect the evader, while the evader moves under a ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract This paper deals with a multistage twoperson zerosum game called the multistage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher distributes his searching resources in a discrete search space to detect the evader, while the evader moves under an energy constraint to evade the searcher. At each stage of the search, the searcher is informed of the evader’s position and his moving energy, and the evader knows the rest of the searcher’s budget, by which the searcher allocates searching resources. A payoff of the game is the probability of detecting the evader during the search. There have been few search games that have dealt with the MSSAG. We formulate the problem as a dynamic programming problem. Then, we solve the game to obtain a closed form of equilibrium point, and to investigate the properties of the solution theoretically and numerically.