NetworkGames: Simulating Cooperation in Network Games with Personality-driven LLM Agents
Xuan Qiu

TL;DR
NetworkGames introduces a framework using personality-driven LLM agents in network games to study how heterogeneity and topology influence collective cooperation, with implications for online social environments.
Contribution
The paper presents a novel simulation framework combining LLMs and network topology to analyze collective behavior and cooperation in complex social networks.
Findings
Small-world networks reduce cooperation.
Strategic placement of pro-social personalities enhances cooperation.
Dyadic interactions alone do not predict macro-level outcomes.
Abstract
While Large Language Models (LLMs) have been extensively tested in dyadic game-theoretic scenarios, their collective behavior within complex network games remains surprisingly unexplored. To bridge this gap, we present NetworkGames, a framework connecting Generative Agents and Geometric Deep Learning. By formalizing social simulation as a message-passing process governed by LLM policies, we investigate how node heterogeneity (MBTI personalities) and network topology co-determine collective welfare. We instantiate a population of LLM agents, each endowed with a distinct personality from the MBTI taxonomy, and situate them in various network structures (e.g., small-world and scale-free). Through extensive simulations of the Iterated Prisoner's Dilemma, we first establish a baseline dyadic interaction matrix, revealing nuanced cooperative preferences between all 16 personality pairs. We…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
