Good neighbors are hard to find: computational complexity of network formation

We investigate the computational complexity of several decision problems in a simple strategic game of network formation. We find that deciding if a player has a strategy that guarantees him a certain payoff against a given strategy profile of the other players is an NP-complete problem. Deciding if there exists a strategy profile that guarantees a certain aggregate payoff is also NP-complete. Deciding if there is a Nash equilibrium in pure strategies which guarantees a certain payoff to each player is NP-hard. The problem of deciding if a given strategy profile is a Nash equilibrium is investigated as well.

[1]  Joseph M. Whitmeyer.  A deductive approach to friendship networks , 2002 .

[2]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[3]  Endre Boros,et al.  Minimization of Half-Products , 1998, Math. Oper. Res..

[4]  Sanjeev Goyal,et al.  A Noncooperative Model of Network Formation , 2000 .

[5]  Sudipta Sarangi,et al.  (Non-)existence and Scope of Nash Networks , 2007 .

[6]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[7]  D. Koller,et al.  Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .

[8]  R. Radner.  Monitoring Cooperative Agreements in a Repeated Principal-Agent Relationship , 1981 .

[9]  Matthew O. Jackson,et al.  On the Formation of Networks and Groups , 2003 .

[10]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[11]  Hans Haller,et al.  Complexity and stochastic evolution of dyadic networks , 2006, Comput. Oper. Res..

[12]  Paul Belleflamme,et al.  Market Sharing Agreements and Collusive Networks , 2001 .

[13]  Eitan Zemel,et al.  Nash and correlated equilibria: Some complexity considerations , 1989 .

[14]  Dawn Iacobucci,et al.  Interactive marketing and the meganet: Networks of networks , 1998 .

[15]  L. Blume.  The Statistical Mechanics of Best-Response Strategy Revision , 1995 .

[16]  Ulrich Schwalbe,et al.  Evolution, interaction, and Nash equilibria , 1996 .

[17]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

[18]  Christos H. Papadimitriou,et al.  Three-Player Games Are Hard , 2005, Electron. Colloquium Comput. Complex..

[19]  D. M. Topkis.  Supermodularity and Complementarity , 1998 .

[20]  Vincent Conitzer,et al.  Complexity Results about Nash Equilibria , 2002, IJCAI.

[21]  D. Iacobucci,et al.  Modeling Dyadic Interactions and Networks in Marketing , 1992 .

[22]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[23]  Sanjeev Goyal,et al.  Network Formation with Heterogeneous Players , 2002, Games Econ. Behav..

[24]  Xi Chen,et al.  3-NASH is PPAD-Complete , 2005, Electron. Colloquium Comput. Complex..

[25]  Robert P. Gilles,et al.  Network potentials , 2007 .

[26]  Éva Tardos,et al.  Near-optimal network design with selfish agents , 2003, STOC '03.

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[29]  R. McKelvey,et al.  Computation of equilibria in finite games , 1996 .

[30]  Christos H. Papadimitriou,et al.  Computing correlated equilibria in multi-player games , 2005, STOC '05.

[31]  H. Simon,et al.  A Behavioral Model of Rational Choice , 1955 .

[32]  Tim Roughgarden,et al.  Computing equilibria in multi-player games , 2005, SODA '05.

[33]  Ulrich Schwalbe,et al.  Conventions, local interaction, and automata networks , 1996 .

[34]  Hans Haller,et al.  Nash networks with heterogeneous links , 2005, Math. Soc. Sci..

[35]  R. Radner.  Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives , 1980 .

[36]  D. Iacobucci.  Networks in Marketing , 1996 .

[37]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..