A graph-theoretic network security game
暂无分享,去创建一个
[1] W. T. Tutte. A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.
[2] Paul G. Spirakis,et al. The Price of Defense and Fractional Matchings , 2006, ICDCN.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Paul G. Spirakis,et al. The Power of the Defender , 2006, 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06).
[5] Andrew V. Goldberg,et al. Maximum Skew-Symmetric Flows , 1995, ESA.
[6] L. Lovász. Matching Theory (North-Holland mathematics studies) , 1986 .
[7] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[8] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[9] D. West. Introduction to Graph Theory , 1995 .
[10] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[11] Marios Mavronicolas,et al. How Many Attackers Can Selfish Defenders Catch? , 2008, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008).
[12] James Aspnes,et al. Inoculation strategies for victims of viruses and the sum-of-squares partition problem , 2005, SODA '05.
[13] Paul G. Spirakis,et al. A Network Game with Attackers and a Defender , 2008, Algorithmica.
[14] Paul G. Spirakis,et al. The Price of Defense , 2006, Algorithmica.
[15] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.