Inoculation strategies for victims of viruses and the sum-of-squares partition problem

DOI10.1016/j.jcss.2006.02.003zbMath1100.68073MaRDI QIDQ2507699

Yanyan Li

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

zbMATH Keywords

price of anarchy; computer virus model; security externalities; economics of security; sum-of-squares partition

Mathematics Subject Classification ID

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

Bio-inspired paradigms in network engineering games, Defending against multiple different attackers, Strategic multiway cut and multicut games, On the inapproximability of minimizing cascading failures under the deterministic threshold model, 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