IEEE Spectrum
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast Approximate Graph Partitioning Algorithms
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The economics of information security investment
ACM Transactions on Information and System Security (TISSEC)
A Polylogarithmic Approximation of the Minimum Bisection
SIAM Journal on Computing
On computer viral infection and the effect of immunization
ACSAC '00 Proceedings of the 16th Annual Computer Security Applications Conference
A Different Look at Secure Distributed Computation
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Why Information Security is Hard-An Economic Perspective
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Journal of Computer Security - IFIP 2000
Measuring and Modeling Computer Virus Prevalence
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A graph-theoretic network security game
International Journal of Autonomous and Adaptive Communications Systems
Bayesian Auctions with Friends and Foes
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Economics of malware: epidemic risks model, network externalities and incentives
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
Finding effectors in social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable byzantine computation
ACM SIGACT News
Finding spread blockers in dynamic networks
SNAKDD'08 Proceedings of the Second international conference on Advances in social network mining and analysis
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Toward optimal vaccination strategies for probabilistic models
Proceedings of the 20th international conference companion on World wide web
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Communications of the ACM
Social communications assisted epidemic disease influence minimization
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
On the inapproximability of minimizing cascading failures under the deterministic threshold model
Information Processing Letters
| Hi-index | 0.02 |
We propose a simple game for modeling containment of the spread of viruses in a graph of n nodes. Each node must choose to either install anti-virus software at some known cost C, or risk infection and a loss L if a virus that starts at a random initial point in the graph can reach it without being stopped by some intermediate node. We prove many game theoretic properties of the model, including an easily applied characterization of Nash equilibria, culminating in our showing that a centralized solution can give a much better total cost than an equilibrium solution. Though it is NP-hard to compute such a social optimum, we show that the problem can be reduced to a previously unconsidered combinatorial problem that we call the sum-of-squares partition problem. Using a greedy algorithm based on sparse cuts, we show that this problem can be approximated to within a factor of O(log1.5 n).