On parameterized complexity of binary networked public goods game

DOI10.1007/s00453-023-01174-4arXiv2012.01880OpenAlexW3106803449MaRDI QIDQ6185945

Arnab Maiti, Palash Dey

Publication date: 9 January 2024

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

parameterized complexitybinary networked public goods gamepure staretgy Nash equilibrium

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Public goods in networks
• Incentive-based search for efficient equilibria of the public goods game
• Tractable cases of the extended global cardinality constraint
• On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
• Network Games
• Contagion
• The Complexity of Computing a Nash Equilibrium
• Parameterized Algorithms

This page was built for publication: On parameterized complexity of binary networked public goods game