A search game when a search path is given

A search game when a search path is given In this paper, we investigate a search game in discrete time and space. A searcher is given a search path in advance and his look on the path is determined by a randomized look strategy. A target selects a path from some options. The searcher gains a value on the detection of the target but expends search cost by the look. A pay-off function of the game for the searcher is the expected reward which is defined as the expected value minus the expected search cost. First, we show a recursive relation for the conditional optimal look strategy of the searcher given a target path. We prove its NP-completeness, though it looks simple, and clarify some characteristics of the solution. Then our original continuous game is converted to a matrix game. From these facts, we consider a relationship between the game and the one-sided optimizing problem and examine some examples. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research Elsevier

A search game when a search path is given

Loading next page...
 
/lp/elsevier/a-search-game-when-a-search-path-is-given-LPCMLhmp1l
Publisher
Elsevier
Copyright
Copyright © 2000 Elsevier Science B.V.
ISSN
0377-2217
eISSN
1872-6860
D.O.I.
10.1016/S0377-2217(99)00120-4
Publisher site
See Article on Publisher Site

Abstract

In this paper, we investigate a search game in discrete time and space. A searcher is given a search path in advance and his look on the path is determined by a randomized look strategy. A target selects a path from some options. The searcher gains a value on the detection of the target but expends search cost by the look. A pay-off function of the game for the searcher is the expected reward which is defined as the expected value minus the expected search cost. First, we show a recursive relation for the conditional optimal look strategy of the searcher given a target path. We prove its NP-completeness, though it looks simple, and clarify some characteristics of the solution. Then our original continuous game is converted to a matrix game. From these facts, we consider a relationship between the game and the one-sided optimizing problem and examine some examples.

Journal

European Journal of Operational ResearchElsevier

Published: Jul 1, 2000

References

  • Path constrained search problem with reward criterion
    Hohzaki, R.; Iida, K.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off