Wiretapping a hidden network

We consider the problem of maximizing the probability of hitting a strategically chosen hidden virtual network by placing a wiretap on a single link of a communication network. This can be seen as a two-player win-lose (zero-sum) game that we call the wiretap game. The value of this game is the greatest probability that the wiretapper can secure for hitting the virtual network. The value is shown to be equal the reciprocal of the strength of the underlying graph. We provide a polynomial-time algorithm that finds a linear-sized description of the maxmin-polytope, and a characterization of its extreme points. It also provides a succint representation of all equilibrium strategies of the wiretapper that minimize the number of pure best responses of the hider. Among these strategies, we efficiently compute the unique strategy that maximizes the least punishment that the hider incurs for playing a pure strategy that is not a best response. Finally, we show that this unique strategy is the nucleolus of the recently studied simple cooperative spanning connectivity game.

[1]  T. Raghavan,et al.  An algorithm for finding the nucleolus of assignment games , 1994 .

[2]  Michael Wooldridge,et al.  Computational Complexity of Weighted Threshold Games , 2007, AAAI.

[3]  S. Oishi,et al.  On principal partition of matroids with parity condition into strongly irreducible minors pairs , 1985 .

[4]  Edith Elkind,et al.  Computing the nucleolus of weighted voting games , 2008, SODA.

[5]  Eddie Cheng,et al.  A Faster Algorithm for Computing the Strength of a Network , 1994, Inf. Process. Lett..

[6]  Aranyak Mehta,et al.  Design is as Easy as Optimization , 2010, SIAM J. Discret. Math..

[7]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[8]  Toshihide Ibaraki,et al.  Complexity of the Minimum Base Game on Matroids , 1997, Math. Oper. Res..

[9]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[10]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[11]  G. Owen,et al.  The kernel/nucleolus of a standard tree game , 1996 .

[12]  D. Schmeidler.  The Nucleolus of a Characteristic Function Game , 1969 .

[13]  Stef Tijs,et al.  The Nucleolus of a Matrix Game and Other Nucleoli , 1992, Math. Oper. Res..

[14]  Dan Gusfield,et al.  Connectivity and Edge-Disjoint Spanning Trees , 1983, Information Processing Letters.

[15]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[16]  Xiaotie Deng,et al.  Finding nucleolus of flow game , 2006, SODA '06.

[17]  Hong-Jian Lai,et al.  Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids , 1992, Discret. Appl. Math..

[18]  Kamal Jain.  Security based on network topology against the wiretapping attack , 2004, IEEE Wireless Communications.

[19]  Sachin B. Patkar,et al.  Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition , 2000, FSTTCS.

[20]  Rahul Savani,et al.  Power Indices in Spanning Connectivity Games , 2009, AAIM.

[21]  Xiaotie Deng,et al.  Algorithmic Cooperative Game Theory , 2008 .

[22]  Jeroen Kuipers,et al.  Note Computing the nucleolus of min-cost spanning tree games is NP-hard , 1998, Int. J. Game Theory.

[23]  Jeroen Kuipers,et al.  On the computation of the nucleolus of a cooperative game , 2001, Int. J. Game Theory.

[24]  V. A. Trubin,et al.  Strength of a graph and packing of trees and branchings , 1993 .