A game on a distributed network.
From MaRDI portal
Publication:3396586
Recommendations
Cited in
(18)- Game-theoretic robustness of many-to-one networks
- Decomposition of probability marginals for security games in abstract networks
- Network games with and without synchroneity
- How many attackers can selfish defenders catch?
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Potential game approach to virus attacks in network with general topology
- Algorithms and Computation
- Equilibrium games in networks
- A network game with attackers and a defender
- Interdependent defense games with applications to internet security at the level of autonomous systems
- Attack and interception in networks
- Quantifying network topology robustness under budget constraints: general model and computational complexity
- The price of defense
- Connected subgraph defense games
- The Price of Defense
- When selfish meets evil, Byzantine players in a virus inoculation game
- Path-disruption games: bribery and a probabilistic model
- Computation of Nash equilibria of attack and defense games on networks
This page was built for publication: A game on a distributed network.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396586)
