Tight inapproximability of Nash equilibria in public goods games

DOI10.1016/J.IPL.2024.106486zbMATH Open1541.91055MaRDI QIDQ6551709

Alexandros Hollender, Jérémi Do Dinh

Publication date: 7 June 2024

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitygame theoryNash equilibriumpublic goodPPAD

Mathematics Subject Classification ID

Applications of game theory (91A80) Public goods (91B18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• On the private provision of public goods on networks
• Public goods in networks
• Public goods in directed networks
• On the Complexity of Nash Equilibria and Other Fixed Points
• Network Games
• Settling the complexity of computing two-player Nash equilibria
• Inapproximability of Nash Equilibrium
• Best-response dynamics in directed network games
• Public goods games in directed networks
• Complexity of public goods games on graphs

This page was built for publication: Tight inapproximability of Nash equilibria in public goods games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551709)