DeepAI
Log In Sign Up

On Parameterized Complexity of Binary Networked Public Goods Game

12/03/2020
by   Arnab Maiti, et al.
0

In the Binary Networked Public Goods game, every player needs to decide if she participates in a public project whose utility is shared equally by the community. We study the problem of computing if there exists a pure strategy Nash equilibrium (PSNE) in such games. The problem is already known to be NP-complete. We provide fine-grained analysis of this problem under the lens of parameterized complexity theory. We consider various natural graph parameters and show either W[1]-hardness or exhibit an FPT algorithm. We finally exhibit some special graph classes, for example path, cycle, bi-clique, complete graph, etc., which always have a PSNE if the utility function of the players are fully homogeneous.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/01/2022

On Binary Networked Public Goods Game with Altruism

In the classical Binary Networked Public Goods (BNPG) game, a player can...
11/13/2019

Computing Equilibria in Binary Networked Public Goods Games

Public goods games study the incentives of individuals to contribute to ...
01/27/2023

Complexity of equilibria in binary public goods games on undirected graphs

We study the complexity of computing equilibria in binary public goods g...
12/05/2020

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

We study the complexity of several combinatorial problems in the model o...
05/18/2021

Cooperation in Threshold Public Projects with Binary Actions

When can cooperation arise from self-interested decisions in public good...
07/09/2022

Complexity of Public Goods Games on Graphs

We study the computational complexity of "public goods games on networks...
10/04/2022

The Complexity of Online Graph Games

Online computation is a concept to model uncertainty where not all infor...