Darvariu, V-A;
Hailes, S;
Musolesi, M;
(2021)
Solving Graph-based Public Good Games with Tree Search and Imitation Learning.
In:
Advances in Neural Information Processing Systems 34 pre-proceedings (NeurIPS 2021).
NeurIPS (Neural Information Processing Systems)
Preview |
Text
maintext.pdf - Published Version Download (2MB) | Preview |
Abstract
Public goods games represent insightful settings for studying incentives for individual agents to make contributions that, while costly for each of them, benefit the wider society. In this work, we adopt the perspective of a central planner with a global view of a network of self-interested agents and the goal of maximizing some desired property in the context of a best-shot public goods game. Existing algorithms for this known NP-complete problem find solutions that are sub-optimal and cannot optimize for criteria other than social welfare.In order to efficiently solve public goods games, our proposed method directly exploits the correspondence between equilibria and the Maximal Independent Set (mIS) structural property of graphs. In particular, we define a Markov Decision Process which incrementally generates an mIS, and adopt a planning method to search for equilibria, outperforming existing methods. Furthermore, we devise a graph imitation learning technique that uses demonstrations of the search to obtain a graph neural network parametrized policy which quickly generalizes to unseen game instances. Our evaluation results show that this policy is able to reach 99.5\% of the performance of the planning method while being three orders of magnitude faster to evaluate on the largest graphs tested. The methods presented in this work can be applied to a large class of public goods games of potentially high societal impact and more broadly to other graph combinatorial optimization problems.
Type: | Proceedings paper |
---|---|
Title: | Solving Graph-based Public Good Games with Tree Search and Imitation Learning |
Event: | NeurIPS 2021: 35th Conference on Neural Information Processing Systems |
Location: | Online |
Dates: | 06 December 2021 - 14 December 2021 |
Open access status: | An open access version is available from UCL Discovery |
Publisher version: | https://proceedings.neurips.cc/paper/2021/hash/0db... |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10137157 |




Archive Staff Only
![]() |
View Item |