PaperlayerView exact revision on arXiv

Source-linked AI summary

Agent-based Modeling: Equilibrium, Echo Chambers, and Efficiency in Hybrid Coevolutionary Opinion Games

Ming-Zhi Jiang, An-Tzi Teng, Jun-En Liu, Po-An Chen, Yung-Ming Li

arXiv:2609.27639v1cs.GTcs.MAcs.SI

TL;DR

Online opinion formation changes beliefs and social ties together, but prior analytical and language-based approaches leave a gap in studying their shared efficiency. The paper combines cost-minimizing and language-based agents in a dynamically rewired network. The network reaches an attractor under language-based updating as reliably as under an analytical update rule, enabling comparison of converged states.

  • Problem

    Analytical models use fixed numerical updates, while the convergence and collective efficiency of language-based agents in coevolving opinion networks remain unclear.

    Source: §1 · pp. 1–2

  • Method

    H-COG combines cost-minimizing Type-C and language-based Type-L agents in a rewiring network, initialized from Reddit-derived stance distributions and varied by mixture, topic, and initial topology.

    Source: §1 · p. 2

  • Results

    The coevolving graph enters an attractor under Type-L updating as reliably as under an update rule with a known fixed point.

    Source: §6.5.1 · p. 15, §7.2 · p. 21

  • Takeaways & Limitations

    This convergence makes it possible to read efficiency differences as comparisons between equilibria rather than snapshots.

    Source: §7.2 · p. 21

    All Type-L agents instantiate one model, so the design does not establish whether the efficiency gap generalizes across language models.

    Source: §7.3 · p. 21

Abstract

from arXiv · show

Opinion formation in online networks involves changes in both beliefs and social ties. Analytical models make it possible to study equilibrium and social cost, but usually represent communication as a fixed numerical update. LLM-driven agents offer a language-based alternative, yet their convergence and collective efficiency remain unclear. We develop the Hybrid Coevolutionary Opinion Game (H-COG), combining cost-minimizing Friedkin-Johnsen agents (Type-C) and Phi-4 language agents (Type-L) in a dynamically rewired K-nearest-neighbor network. We initialize 50 agents with opinions drawn from 5,199 Reddit comments on gun control and abortion. The comments are scored on a continuous [-1,+1] scale using a fine-tuned RoBERTa regressor, and a mixing parameter sets the proportion of each agent type. The experiments cover nine population compositions, three initial network topologies, and two topics. All 540 runs meet the convergence criterion within the simulation horizon. Under Type-L updating, the coevolving network reaches an attractor as reliably as it does under the analytical update rule, making an equilibrium-based efficiency comparison possible. The pooled Price of Anarchy is $5.558 \pm 0.309$ for purely Type-L populations, compared with $1.139 \pm 0.005$ for purely Type-C populations. A decomposition of social cost attributes most of this gap to language agents moving away from their intrinsic opinions, rather than to greater disagreement with their neighbors. The main findings are consistent across the three initial network topologies.

1 Introduction

The paper addresses the lack of a shared framework for studying language-based and cost-based agents’ efficiency in a network where opinions and ties coevolve. It introduces H-COG and compares agent mixtures using empirically grounded opinions and common efficiency measures.

1 Introduction

  • Existing LLM simulations retain semantic interaction but do not measure social cost or Price of Anarchy when language-driven and cost-driven agents share a network.The paper frames this as the gap between analytical models’ formal efficiency tools and language-based models’ treatment of communication.Source: §1 · pp. 1–2

1.2 Contributions

  • H-COG places cost-minimizing Type-C agents and language-based Type-L agents in one network where opinions and connections coevolve.The mixing parameter α varies their proportions, and agents use the same continuous opinion scale.Source: §1.2 · p. 2, §1 · p. 2
  • A two-stage pipeline derives real-world stance distributions from Reddit comments using semantic clustering, a fine-tuned RoBERTa regressor, and stratified sampling.The resulting distributions initialize agents’ intrinsic opinions.Source: §1.2 · p. 2
  • Social cost and topology-conditioned PoA are evaluated on a shared opinion scale, with social cost decomposed into disagreement and conformity components.This decomposition is used to identify the source of efficiency differences.Source: §1.2 · p. 2

1.1 Research Questions

  • The comparison spans nine Type-C/Type-L mixing levels, two topics, and three initial topologies, evaluating efficiency, polarization, echo-chamber structure, and convergence.The research questions also ask how composition affects social cost and PoA, polarization and network dynamics, and the components behind efficiency differences.Source: §1.2 · p. 2, §1.1 · p. 2, §1 · p. 2

2 Related Work

Analytical opinion models offer formal tools for equilibrium and efficiency, while LLM-based simulations preserve language and context in agent interactions. Prior language-based echo-chamber studies report behavioral outcomes, leaving the efficiency of their equilibria an open question.

2.1 Opinion Dynamics and Coevolutionary Games

  • DeGroot and Friedkin–Johnsen models describe numerical opinion updates, while coevolutionary games also allow networks to change and support Price of Anarchy analysis.The cited coevolutionary work studies agents who choose similar-minded neighbors and balance social pressure against private belief.Source: §2.1 · p. 3
  • These analytical models use numerical update rules and omit the reasoning, memory, and meaning involved in forming and stating opinions.This limitation motivates language-based agents as a complementary modeling approach.Source: §2.1 · p. 3

2.2 LLM-based Agent Simulation for Echo Chambers

  • LLM-based simulations let agents read, reason, and respond in language; studies of echo chambers report polarization patterns and comparisons with analytical models.Wang et al. report closer tracking of observed polarization than Friedkin–Johnsen or bounded-confidence models, while Gu et al. ground simulations in Twitter data [Wang et al., 2025, Gu et al., 2025].Source: §2.2 · p. 3
  • Prior echo-chamber studies use one agent type and descriptive indices, leaving the social cost of language-based equilibria unexamined.Whether language-based reasoning leaves a population better or worse off remains open in the cited work.Source: §2.2 · p. 3

3 Model and Problem Formulation

The model places analytical and language-generating agents on a common opinion scale, updates their expressed opinions, and rewires their network. It evaluates costs and equilibrium behavior on the resulting coevolving system.

3.1 Agents and Opinions

  • Each agent has a fixed intrinsic stance and an evolving expressed opinion; α sets the Type-C fraction, with Type-L agents making natural-language opinions mapped to the shared numerical scale.The α = 1 and α = 0 cases are the purely numerical and purely LLM-driven baselines, respectively.Source: §3.1 · pp. 3–4

3.2 State Space and Opinion Updates

  • The global state includes the directed network and Type-L agents’ preceding structured text records.The records are part of the state alongside agent opinions and network relationships.Source: §3.2 · p. 4

Type-C analytical agents

  • Type-C agents choose numerical opinions by minimizing myopic stage cost while holding neighbors’ latest opinions fixed.The simulations use this myopic update; the opinion domain remains within [−1, +1].Source: Type-C analytical agents · p. 4

Type-L generative agents

  • Type-L actions contain reasoning, opinion, and memory; their prompts use prior records, neighbor messages, and intrinsic stance.The simulations use deterministic decoding, one LLM call per step, and a rewritten memory field limited to 120 words.Source: Type-L generative agents · p. 4

3.3 Coevolutionary Rewiring

  • After opinion updates, each agent connects to the five peers whose expressed opinions are nearest its intrinsic stance, with ties broken by seeded randomness.Rewiring is an environmental kernel rather than an agent action.Source: §3.3 · pp. 4–5

3.4 Social Cost and Price of Anarchy

  • Social cost sums individual costs, including disagreement with current neighbors and displacement from intrinsic opinions.The planner optimizes opinions on the same realized graph, isolating decentralized updating loss from loss associated with the rewired topology.Source: §3.4 · pp. 5–6
  • The generalized hybrid PoA compares equilibrium social cost with the planner’s minimum cost; equilibrium conditions distinguish Type-C optimization from Type-L policies induced by the LLM kernel.The formulation uses stationary state-action distributions at each mixture level.Source: §3.4 · p. 5

3.5 Evaluation Metrics

  • Polarization is measured as variance in expressed opinions, modularity is compared with a degree-preserving null model, and structural convergence measures are logged at each graph transition.The null-corrected modularity measure captures opinion-based sorting relative to the same degree sequence.Source: §3.5 · p. 6

4.1 Simulation Framework Overview

The overview figure summarizes a two-stage pipeline from Reddit-based stance measurement to H-COG simulations and metric recording.

4.1 Simulation Framework Overview

  • The pipeline scores and stratifies Reddit comments to initialize 50 agents, then assigns types by α and runs H-COG until its stopping rule is met.Each step records social cost and PoA, polarization, null-corrected modularity, and structural convergence measures.Source: §4.1 · p. 6

4.2 Stage 1: Reddit Data Pipeline

The Reddit pipeline turns topic comments into continuous stance scores and samples agents to reflect the empirical stance distribution. Those scores provide a shared scale for initializing the simulation.

Corpus Processing and Topic Clustering

  • Comments are encoded and clustered into 1,184 topics, then labeled using cluster-level TF–IDF terms.The corpus pipeline retains selected top-level r/politics comments and uses Sentence-BERT embeddings, UMAP, and HDBSCAN.Source: Corpus Processing and Topic Clustering · pp. 6–7

Continuous Stance Measurement

  • The RoBERTa regressor maps stances to a continuous scale whose negative and positive endpoints indicate opposition and support.Trained on graded argument-quality judgments, it correlates with the graded target at r = 0.926 on held-out judgments and scores Reddit comments and Type-L opinions.Source: Continuous Stance Measurement · p. 7

Stratified Agent Sampling

  • For each topic, 50 agents are sampled by stance stratum, while each agent retains its source comment’s continuous score as its intrinsic opinion.Strata determine sampling quotas, not assigned stance values.Source: Stratified Agent Sampling · pp. 7–8

4.3 Stage 2: H-COG Simulation

H-COG initializes analytical and language agents from topic-specific opinions, then updates their expressed positions and rewires their shared network. The experiments vary starting topologies while controlling other sampled agent attributes within each topic.

4.3.1 Agent Initialization

  • Type-C agents start at their intrinsic opinion and receive independently drawn stubbornness; Type-L agents receive a fixed persona and generate opening text scored as their expressed opinion.The Type-L persona is written once by Phi-4 and held fixed.Source: §4.3.1 · p. 8

4.3.2 Network Initialization

  • Three initial graph families are crossed with nine mixture levels and two topics for 540 runs, while sampled agents and their attributes remain fixed within each topic.The graph families are Barabási–Albert, Erdős–Rényi, and Watts–Strogatz; topology and agent assignment vary across seeds.Source: §4.3.2 · p. 8

4.3.3 Opinion Updates

  • Type-C agents use the Friedkin–Johnsen stage-cost minimizer, while Type-L agents return reasoning, opinion, and memory fields in a fixed order.The opinion field is externally scored, and memory is rewritten each step with a 120-word limit; it does not guarantee stationarity.Source: §4.3.3 · p. 8

4.3.4 K-NN Dynamic Rewiring

  • After each opinion update, every agent connects to its five peers whose expressed opinions are closest to its intrinsic opinion.The network is rebuilt after every update; structural convergence is analyzed because nearly stationary opinions need not imply a stable interaction structure.Source: §4.3.4 · p. 9

4.4 Structural Convergence and Stopping Rule

The stopping rule treats convergence as an attractor or stable structural regime, not necessarily a frozen graph. Runs are evaluated at their own detected convergence point plus a post-detection window.

4.4.1 Convergence Criterion

  • Convergence includes either recurring edge sets or a plateau in graph-change rate, even when individual edges continue to change.Small shifts near the K-neighbor cutoff can replace edges, so adaptive networks may settle into dynamic regimes rather than fixed configurations.Source: §4.4.1 · p. 9

4.4.2 Structural Convergence Metrics

  • Structural change is tracked with neighbor retention, normalized Hamming distance, spectral distance, DeltaCon, and changes in Louvain partitions.Neighbor retention is the mean fraction of neighbors retained between consecutive steps; spectral distance captures global structural changes that edge-level Hamming distance may miss.Source: §4.4.2 · pp. 9–10

4.4.3 Stopping Rule and Attractor Classification

  • A run stops at exact edge-set recurrence or a retention-rate plateau; its graph dynamics are labeled fixed point, limit cycle, plateau, or none.The labels describe observed graph dynamics, not Nash equilibrium; plateaus may be aperiodic or cycles longer than the tested recurrence period.Source: §4.4.3 · p. 10

4.4.4 Cross-Run Comparability

  • Outcome metrics are compared at each run’s own convergence time plus the post-detection window, with fixed-time values retained as robustness checks.The distribution of convergence times is also analyzed across mixture level, topology, and topic.Source: §4.4.4 · p. 10

5 Equilibrium Analysis

The paper frames the hybrid population as a general-sum Markov game to analyze equilibrium and welfare guarantees under OGA dynamics. The theorem gives alternative guarantees, conditional on those learning dynamics and their assumptions.

5 Equilibrium Analysis

  • The analysis addresses why equilibrium proofs are difficult: randomized rewiring can make small opinion shifts alter global transition probabilities.The hybrid population is framed as a multi-player general-sum Markov game.Source: §5 · p. 10

5.1 The Hybrid Game as a Markov Game

  • The game has analytical Type-C and language-based Type-L agents; both act on a common opinion scale, and graph structure supplies a finite state space.The state is represented by interaction graphs, with generated texts entering through their scored opinions.Source: §5.1 · p. 11
  • The guarantees rely on conditions including bounded policy domains, smooth regularizers, a suitably small learning rate, and nonnegative cumulative regret.The learning-rate regime is specified as η ≤ O(1/T).Source: §5.1 · p. 12
  • Under OGA dynamics and the stated conditions, the game guarantees either an O(ε)-approximate hybrid Nash equilibrium at some iteration or a bound on empirical average welfare relative to the central planner.The welfare bound is expressed using the game’s smoothness constants.Source: §5.1 · p. 12

6 Experiments and Numerical Results

The experiments initialize agents from Reddit stance data and compare population compositions across topics and network topologies. All 540 runs completed within the simulation horizon.

6.1 Dataset Overview

  • The dataset includes 3,581 gun-control and 1,618 abortion comments; sampled-agent stance splits were 54/46 and 68/32, respectively.Gun-control stances are bimodal and polarized, while abortion stances concentrate toward the opposing end; the topics share personas and stubbornness coefficients, a modeling simplification.Source: §6.1 · p. 13, Figure 2 · p. 13

6.2 Simulation Configuration

  • All 540 runs completed; the design crossed nine α levels with three initial topologies matched on mean degree.Mean settling time at α = 0 was 52.2 steps, and the longest run lasted 115 steps within the 120-step horizon.Source: §6.2 · p. 14

6.3 Statistical Analysis

  • Unequal PoA variances prompted Welch tests with Benjamini–Hochberg FDR control; topology equivalence used a prespecified 0.2-PoA margin.Topic comparisons used paired tests, and confidence intervals reflect variation across topologies and Type-C/Type-L assignments rather than agent-sample draws.Source: §6.3 · p. 14

6.4 Implementation Details

  • Type-L agents used locally served, quantized Phi-4, while Type-C agents used closed-form Friedkin–Johnsen updates.The numerical α = 1 path was bit-for-bit reproducible across repeated runs.Source: §6.4 · p. 14

6.5 Numerical Results

Across compositions, both pure populations reach structural plateaus, and the pooled Price of Anarchy falls sharply as the share of cost-minimizing agents increases. The efficiency gap is mainly associated with conformity costs, while echo-chamber measures and topology comparisons qualify the pattern.

6.5.1 Convergence of the interaction structure

  • Both pure populations converge predominantly to structural plateaus, and all 540 runs satisfy the convergence criterion within the simulation horizon.Type-L updating reaches the same kind of attractor as Type-C updating, despite the latter’s analytically convergent opinion dynamics.Source: §6.5.1 · pp. 15–16
  • Mean settling time falls from 52.2 steps at α = 0 to 21.7 at α = 0.875, then rises to 25.1 at α = 1.Gun control settles later than abortion at every α; at α = 0, tconv is 58.7 versus 45.7.Source: §6.5.1 · pp. 15, 17

6.5.2 Final-state comparison

  • At converged states, polarization and null-corrected modularity rise with α while PoA falls; all three metrics flatten before the graph’s attractor, making read-out timing immaterial.Table 1 reports metrics at each run’s converged state, tconv + 10.Source: §6.5.2 · p. 17, Table 1 · p. 17, Figure 5 · p. 18

6.5.3 Efficiency and the Price of Anarchy

  • Pooled PoA falls from 5.558 ± 0.309 at α = 0 to 1.139 ± 0.005 at α = 1; the decline becomes significant from α = 0.5 onward.No adjacent comparison through α = 0.375 is significant, and no interior mixture approaches the α = 1 minimum.Source: §6.5.3 · p. 18, Table 2 · p. 19
  • From α = 1 to α = 0, conformity grows by a factor of 13.2 (0.183 → 2.422), versus 3.3 for disagreement (0.956 → 3.136), locating inefficiency in displacement from intrinsic opinions.Conformity’s share of social cost falls monotonically from 43.6% to 16.1% as α increases.Source: §6.5.3 · p. 18, Table 3 · p. 19, Figure 6 · p. 20

6.5.4 Echo chamber formation

  • Pz rises from 0.304 ± 0.015 to 0.597 ± 0.006 and Qnorm from 0.218 ± 0.008 to 0.423 ± 0.002 across α, while corrected community structure remains far above the null throughout.Type-L populations show weaker polarization and weaker community structure than Type-C populations.Source: §6.5.4 · pp. 18–19

6.5.5 Initial topology

  • No topology-family difference is detectable across α, but equivalence is established only at α = 1; under matched mean degree, echo chambers require no pre-existing hub structure.At lower α, high PoA variability means the data cannot exclude a true topology difference of roughly 0.5.Source: §6.5.5 · p. 19

7 Discussions, Conclusions and Future Work

The discussion links lower polarization in Type-L populations to agents moving away from their prior opinions, not to improved collective efficiency. It concludes that language-driven dynamics can support equilibrium-based comparisons, while identifying limits on generalization, sampling, topology comparisons, and community measurement.

7.1 Interpretation of Key Findings

  • Type-L agents’ displacement from their prior opinions dominates their inefficiency; the same susceptibility weakens polarization and camp consolidation.The discussion contrasts this with Type-C agents, whose cost function penalizes departure from their prior positions.Source: §7.1 · p. 20
  • Mixed populations settle into exactly stationary structures more often than either pure population, while a small Type-C minority raises social cost on one topic but not the other.The authors attribute the topic difference to stance-distribution shape rather than agent personas or stubbornness coefficients.Source: §7.1 · p. 20
  • As the Type-C share rises, opinion variance and null-corrected modularity rise while Price of Anarchy falls, so lower polarization does not imply greater efficiency.Both vertical axes in Figure 7 start at zero.Source: §7.1 · p. 20, Figure 7 · p. 21

7.2 Conclusions

  • The authors conclude that equilibrium analysis can extend to language-driven opinion dynamics because the coevolving graph reaches an attractor as reliably as under analytical updating.This supports reading the reported efficiency gap as a comparison between equilibria rather than snapshots.Source: §7.2 · p. 21

7.3 Limitations and Future Work

  • Because all Type-L agents use one model, the study cannot determine whether the efficiency gap generalizes to language-based updating or reflects that model’s disposition to persuasion.Applying the social-cost decomposition across models is identified as a direct extension.Source: §7.3 · p. 21
  • Confidence intervals cover topology and agent-type assignments, not new sample draws; the two topics are also not independent replicates because they share personas.Source: §7.3 · p. 21
  • Topology equivalence is established only for purely Type-C populations; at low mixing ratios, variability exceeds the tested margin’s resolution.The authors say confirmation across the range would require a relative margin or more seeds.Source: §7.3 · p. 22
  • At this network size, modularity’s resolution limit can merge distinct communities, making reported compartmentalization conservative.Source: §7.3 · p. 22

Related papers

Loading 2609.27639v1…