|
|
|
|
|
Davide Bilò, Luciano Gualà and Guido Proietti
Consider a communication network represented by a directed graph ??=(??,??)
G
=
(
V
,
E
)
of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose cost...
ver más
|
|
|
|
|
|
|
|
|
|
|
Serhii Yevseiev,Oleksandr Milov,Stanislav Milevskyi,Oleksandr Voitko,Maksym Kasianenko,Yevgen Melenti,Serhii Pohasii,Hrygorii Stepanov,Oleksandr Turinskyi,Serhii Faraon
Pág. 15 - 29
A game-theoretic approach is presented, which claims to be a universal method for solving most problems in the field of cybersecurity. As arguments to confirm the superiority of game theory, mathematical validity and provability of the optimality of deci...
ver más
|
|
|
|
|
|