Complexity of Public Goods Games on Graphs

Matan Gilboa, Noam Nisan

We study the computational complexity of "public goods games on networks". In this model, each vertex in a graph is an agent that needs to take a binary decision of whether to "pro…