Complexity of public goods games on graphs

DOI10.1007/978-3-031-15714-1_9zbMath1520.91080arXiv2207.04238OpenAlexW4296007137MaRDI QIDQ6164507

Noam Nisan, Matan Gilboa

Publication date: 28 July 2023

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.04238

zbMATH Keywords

computational complexityNash equilibriumpublic goods

Mathematics Subject Classification ID

Games involving graphs (91A43) Public goods (91B18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Algorithmic game theory and complexity (91A68)

Related Items (1)

Complexity of public goods games on graphs

Cites Work

• Public goods in networks
• The complexity of satisfiability problems
• Complexity of public goods games on graphs

This page was built for publication: Complexity of public goods games on graphs