Statistical Modeling of Networked Evolutionary Public Goods Games

Authors: Hiroyasu Ando, Akihiro Nishi, Mark S. Handcock

22 pages, 6 figures,

Abstract: Repeated small dynamic networks are integral to studies in evolutionary game theory, where networked public goods games offer novel insights into human behaviors. Building on these findings, it is necessary to develop a statistical model that effectively captures dependencies across multiple small dynamic networks. While Separable Temporal Exponential-family Random Graph Models (STERGMs) have demonstrated success in modeling a large single dynamic network, their application to multiple small dynamic networks with less than 10 actors, remains unexplored. In this study, we extend the STERGM framework to accommodate multiple small dynamic networks, offering an approach to analyzing such systems. Taking advantage of the small network sizes, our proposed approach improves accuracy in statistical inference through direct computation, unlike conventional approaches that rely on Markov Chain Monte Carlo methods. We demonstrate the validity of this framework through the analysis of a networked public goods experiment into individual decision-making about cooperation and defection. The resulting statistical inference uncovers novel insights into the dynamics of social dilemmas, showcasing the effectiveness and robustness of this modeling and approach.

Submitted to arXiv on 13 Jan. 2025

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.