A Characterization of Complexity in Public Goods Games

01/27/2023
by   Matan Gilboa, et al.
0

We complete the characterization of the computational complexity of equilibrium in public goods games on graphs by proving that the problem is NP-complete for every finite non-monotone best-response pattern. This answers the open problem of [Gilboa and Nisan, 2022], and completes the answer to a question raised by [Papadimitriou and Peng, 2021], for all finite best-response patterns.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset