Geodesic
An idempotent algorithm for a class of network-disruption games
Kybernetika, Tome 52 (2016) no. 5, pp. 666-695.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even for small networks, the state-space dimension is high. Idempotent algebra-based methods are used to generate an algorithm not subject to the curse-of-dimensionality. An example is included.
DOI : 10.14736/kyb-2016-5-0666
Classification : 14T05, 15A80, 49L20, 90C35, 91A80
Keywords: idempotent; max-plus; tropical; network; dynamic programming; game theory; command and control 
@article{10_14736_kyb_2016_5_0666,
     author = {M. McEneaney, William and Pandey, Amit},
     title = {An idempotent algorithm for a class of network-disruption games},
     journal = {Kybernetika},
     pages = {666--695},
     publisher = {mathdoc},
     volume = {52},
     number = {5},
     year = {2016},
     doi = {10.14736/kyb-2016-5-0666},
     mrnumber = {3602010},
     zbl = {06674934},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2016-5-0666/}
}
TY  - JOUR
AU  - M. McEneaney, William
AU  - Pandey, Amit
TI  - An idempotent algorithm for a class of network-disruption games
JO  - Kybernetika
PY  - 2016
SP  - 666
EP  - 695
VL  - 52
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2016-5-0666/
DO  - 10.14736/kyb-2016-5-0666
LA  - en
ID  - 10_14736_kyb_2016_5_0666
ER  - 
%0 Journal Article
%A M. McEneaney, William
%A Pandey, Amit
%T An idempotent algorithm for a class of network-disruption games
%J Kybernetika
%D 2016
%P 666-695
%V 52
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2016-5-0666/
%R 10.14736/kyb-2016-5-0666
%G en
%F 10_14736_kyb_2016_5_0666
M. McEneaney, William; Pandey, Amit. An idempotent algorithm for a class of network-disruption games. Kybernetika, Tome 52 (2016) no. 5, pp. 666-695. doi : 10.14736/kyb-2016-5-0666. http://geodesic.mathdoc.fr/articles/10.14736/kyb-2016-5-0666/

Cité par Sources :