Inoculation strategies for victims of viruses and the sum-of-squares partition problem
From MaRDI portal
Publication:2507699
DOI10.1016/j.jcss.2006.02.003zbMath1100.68073MaRDI QIDQ2507699
Publication date: 5 October 2006
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.02.003
price of anarchy; computer virus model; security externalities; economics of security; sum-of-squares partition
68Q25: Analysis of algorithms and problem complexity
68R05: Combinatorics in computer science
91A43: Games involving graphs
91A80: Applications of game theory
68R10: Graph theory (including graph drawing) in computer science
91A06: (n)-person games, (n>2)
68M14: Distributed systems
68W25: Approximation algorithms
Related Items
Computing Critical Nodes in Directed Graphs, Dynamic Games for Analyzing Competition in the Internet and in On-Line Social Networks, How Do You Defend a Network?, Contrasting the Spread of Misinformation in Online Social Networks, Connected subgraph defense games, On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms, Bio-inspired paradigms in network engineering games, Defending against multiple different attackers, Strategic multiway cut and multicut games, Optimal strategies for selecting coordinators, On the inapproximability of minimizing cascading failures under the deterministic threshold model, Individual security, contagion, and network design, Approximability of the firefighter problem. Computing cuts over time, Strategic Network Formation with Attack and Immunization, Network Elicitation in Adversarial Environment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical modeling in epidemiology
- Interdependent security
- On the hardness of approximating Multicut and Sparsest-Cut
- A Polylogarithmic Approximation of the Minimum Bisection
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On the power of unique 2-prover 1-round games
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- Fast Approximate Graph Partitioning Algorithms
- Expander flows, geometric embeddings and graph partitioning