Transiting Areas Patrolled by a Mobile Adversary

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00171063" target="_blank" >RIV/68407700:21230/10:00171063 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Transiting Areas Patrolled by a Mobile Adversary
Original language description
We study the problem of a mobile agent trying to cross an area patrolled by a mobile adversary. The transiting agent aims to choose its route so as to minimize the probability of hostile encounter; the patroller agent, controlling one or more patrol units, aims at the opposite. We model the problem as a two-player zero-sum game (termed transit game) and search for an optimum route selection strategy as a mixed Nash equilibrium of the game. In contrast to existing game-theoretic models of this kind, we explicitly consider the limited endurance of patrols and the notion of bases to which the patrols need to repeatedly return. Noting the prohibitive size of the transit game, we employ two techniques for reducing the complexity of finding Nash equilibria -a compact network-flow-based representation of transit routes and iterative single- and doubleoracle algorithms for incremental game matrix construction
Czech name
—
Czech description
—

Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the IEEE Conference on Computational Intelligence and Games 2010
ISBN
978-1-4244-6297-1
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
IEEE
Place of publication
New Jersey
Event location
Copenhagen
Event date
Aug 18, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)