ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
A graph-theoretic network security game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Network game with attacker and protector entities
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
How many attackers can selfish defenders catch?
Discrete Applied Mathematics
| Hi-index | 0.00 |
To formulate a network security problem, Mavronicholas et al. [6] introduced a strategic game on an undirected graph whose nodes are exposed to infection by attackers, and whose edges are protected by a defender. Subsequently, MedSalem et al. [9] generalized the model so that they have many defenders instead of a single defender. Then in [1], we introduced a new network game with the roles of players interchanged, and obtained a graph-theoretic characterization of its pure Nash equilibria. In this paper we study mixed Nash equilibria for stochastic strategies in this new game, and then we generalize our network game to an asynchronous game, where two players repeatedly execute simultaneous games. Although the asynchronous game is formally an infinite game, we show that it has a stable solution by reducing it to a finite game.