• Corpus ID: 235422263

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

  title={Solving Graph-based Public Good Games with Tree Search and Imitation Learning},
  author={Victor-Alexandru Darvariu and Stephen Hailes and Mirco Musolesi},
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… 

Figures and Tables from this paper


Discriminative Embeddings of Latent Variable Models for Structured Data
In applications involving millions of data points, it is shown that structure2vec runs 2 times faster, produces models which are 10, 000 times smaller, while at the same time achieving the state-of-the-art predictive performance.
Public goods in networks
Bandit Based Monte-Carlo Planning
A new algorithm is introduced, UCT, that applies bandit ideas to guide Monte-Carlo planning and is shown to be consistent and finite sample bounds are derived on the estimation error due to sampling.
Computing Equilibria in Binary Networked Public Goods Games
This paper examines a specific type of public goods game where players are networked and each has binary actions, and proposes a heuristic approach for computing approximate equilibria in general binary networked public goods games.
Thinking Fast and Slow with Deep Learning and Tree Search
This paper presents Expert Iteration (ExIt), a novel reinforcement learning algorithm which decomposes the problem into separate planning and generalisation tasks, and shows that ExIt outperforms REINFORCE for training a neural network to play the board game Hex, and the final tree search agent, trained tabula rasa, defeats MoHex 1.0.
Optimal Equilibria of the Best Shot Game
This work proposes an implementable mechanism that, in the limit of infinite time, reaches an optimal equilibrium, even if this equilibrium and even the network structure is unknown to the social planner.
Seaborn: Statistical Data Visualization
seaborn is a library for making statistical graphics in Python. It provides a high-level interface to matplotlib and integrates closely with pandas data structures. Functions in the seaborn library
Combinatorial optimization and reasoning with graph neural networks
A conceptual review of recent key advancements in combinatorial optimization is presented, aiming at researchers in both optimization and machine learning.
Open Problems in Cooperative AI
This research integrates ongoing work on multi-agent systems, game theory and social choice, human-machine interaction and alignment, natural-language processing, and the construction of social tools and platforms into Cooperative AI, which is an independent bet about the productivity of specific kinds of conversations that involve these and other areas.