Cumulative search‐evasion games

Cumulative search‐evasion games Cumulative search‐evasion games (CSEGs) are two‐person zero‐sum search‐evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T‐time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown‐Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Naval Research Logistics: An International Journal Wiley

Cumulative search‐evasion games

Loading next page...
 
/lp/wiley/cumulative-search-evasion-games-tEh2TjAxc0
Publisher site
See Article on Publisher Site

Abstract

Cumulative search‐evasion games (CSEGs) are two‐person zero‐sum search‐evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T‐time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown‐Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures.

Journal

Naval Research Logistics: An International JournalWiley

Published: Aug 1, 1991

References

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