Solving Graph-based Public Good Games with Tree Search and Imitation Learning

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 an 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 while being approximately 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.


The Challenge of Believability in Video Games: Definitions, Agents Models and Imitation Learning

In this paper, we address the problem of creating believable agents (vir...

Aggregate Play and Welfare in Strategic Interactions on Networks

In recent work by Bramoullé and Kranton, a model for the provision of pu...

Learning to Search via Self-Imitation

We study the problem of learning a good search policy. To do so, we prop...

Altruism Design in Networked Public Goods Games

Many collective decision-making settings feature a strategic tension bet...

Abstracting Imperfect Information Away from Two-Player Zero-Sum Games

In their seminal work, Nayyar et al. (2013) showed that imperfect inform...

Few-Shot Bayesian Imitation Learning with Logic over Programs

We describe an expressive class of policies that can be efficiently lear...

Travel the Same Path: A Novel TSP Solving Strategy

In this paper, we provide a novel strategy for solving Traveling Salesma...

Please sign up or login with your details

Forgot password? Click here to reset