AI Chat AI Image Generator AI Video Text to Speech

A Characterization of Complexity in Public Goods Games

01/27/2023

∙

by Matan Gilboa, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 07/09/2022

Complexity of Public Goods Games on Graphs

We study the computational complexity of "public goods games on networks...

0 Matan Gilboa, et al. ∙

research

∙ 03/14/2018

Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles

In this paper we prove that the general avalanche problem AP is in NC, f...

0 Enrico Formenti, et al. ∙

research

∙ 02/17/2022

The Complexity of SPEs in Mean-payoff Games

We establish that the subgame perfect equilibrium (SPE) threshold proble...

0 Léonard Brice, et al. ∙

research

∙ 05/29/2020

Complexity of Maximum Cut on Interval Graphs

We resolve the longstanding open problem concerning the computational co...

0 Ranendu Adhikary, et al. ∙

research

∙ 02/10/2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

We analyze the computational complexity of several new variants of edge-...

0 Jeffrey Bosboom, et al. ∙

research

∙ 06/01/2018

The Complexity of Bisimulation and Simulation on Finite Systems

In this paper the computational complexity of the (bi)simulation problem...

0 Moses Ganardi, et al. ∙

research

∙ 05/06/2021

Dots Boxes is PSPACE-complete

Exactly 20 years ago at MFCS, Demaine posed the open problem whether the...

0 Kevin Buchin, et al. ∙