TL;DR
This paper extends a statistical model to analyze multiple small dynamic networks in public goods games, enabling better inference of social dilemma dynamics and human behavior.
Contribution
It introduces an extension of STERGM to small networks, improving inference accuracy through direct computation instead of MCMC methods.
Findings
Uncovered new insights into cooperation and defection dynamics.
Validated the model with experimental data.
Demonstrated robustness in social dilemma analysis.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
