A Refined Study of the Complexity of Binary Networked Public Goods Games

by   Yongjie Yang, et al.

We study the complexity of several combinatorial problems in the model of binary networked public goods games. In this game, players are represented by vertices in a network, and the action of each player can be either investing or not investing in a public good. The payoff of each player is determined by the number of neighbors who invest and her own action. We study the complexity of computing action profiles that are Nash equilibrium, and those that provide the maximum utilitarian or egalitarian social welfare. We show that these problems are generally NP-hard but become polynomial-time solvable when the given network is restricted to some special domains, including networks with a constant bounded treewidth, and those whose critical clique graphs are forests.



There are no comments yet.


page 1

page 2

page 3

page 4


Computational Complexity of Hedonic Games on Sparse Graphs

The additively separable hedonic game (ASHG) is a model of coalition for...

On Parameterized Complexity of Binary Networked Public Goods Game

In the Binary Networked Public Goods game, every player needs to decide ...

The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson

Extensive study on the complexity of computing Nash Equilibrium has resu...

One-Clock Priced Timed Games are PSPACE-hard

The main result of this paper is that computing the value of a one-clock...

The Communication Complexity of Local Search

We study the following communication variant of local search. There is s...

Coordination Games on Weighted Directed Graphs

We study strategic games on weighted directed graphs, in which the payof...

Inducing Equilibria in Networked Public Goods Games through Network Structure Modification

Networked public goods games model scenarios in which self-interested ag...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.