Limited-Trust in Diffusion of Competing Alternatives Over Social Networks

Vincent Léon, S. Rasoul Etesami, Rakesh Nagi

TL;DR

This paper introduces "Limited-Trust Equilibrium" (LTE) to model how competing products spread through social networks. Unlike traditional models that assume pure self-interest, LTE accounts for individuals' willingness to sacrifice short-term gains for long-term benefits by trusting their neighbors. This trust-based diffusion model leads to more efficient outcomes and faster adoption of superior products, as demonstrated through game-theoretic analysis and simulations.

What Problem Does This Paper Address?

The paper tackles the challenge of understanding and predicting how competing products or innovations diffuse through social networks. Existing models often assume individuals are purely rational and self-interested, making decisions solely based on immediate personal gain (Nash Equilibrium). However, real-world diffusion, like the adoption of smartphones or social media platforms, often involves more complex human behavior. People might adopt a product that isn't immediately the "best" for them if they believe it will lead to better long-term outcomes through cooperation and reciprocity with their social connections. This paper aims to bridge this gap by introducing a more nuanced model that captures this "limited trust" behavior.

Methods

The authors propose a game-theoretic approach to model diffusion dynamics. They introduce Limited-Trust Equilibrium (LTE), a new equilibrium concept where individuals consider their long-term utility by accepting a small loss in immediate payoff to benefit their neighbors, hoping for future reciprocation. This is contrasted with the standard Nash Equilibrium (NE), which assumes pure self-interest.

Key methodological contributions include:

  • Developing the LTE Diffusion Model: This model incorporates a "trust limit" parameter that quantifies an individual's willingness to sacrifice short-term utility.
  • Markov Chain Analysis: The diffusion process is transformed into a discrete-time Markov chain. This allows for the analysis of convergence rates and equilibrium states using tools like absorption probability and expected absorption time.
  • Mean-Field Approximation: To handle large and complex networks, a mean-field approach is used to approximate interactions and derive the Markov chain model.
  • Connection to Linear Threshold (LT) Model: The paper establishes a link between their LTE diffusion model and the well-known LT model, showing that under certain conditions (deterministic, synchronous updates), the LTE model behaves like an LT model.

Datasets

The paper uses a real-world dataset of the ego-Facebook social network for simulations. This network contains 4,039 nodes and 88,234 undirected edges, representing interactions between users. The authors also simulate diffusion on random graphs with specific degree distributions (regular graphs and graphs with two degree types) to test the generality of their findings and the accuracy of their Markov chain analysis.

Key Insights and Ideas

  • Trust Drives Efficiency: Individuals behaving with "limited trust" (LTE) achieve significantly higher long-term utility compared to purely self-interested individuals (NE). This trust mechanism can lead to the faster and more widespread adoption of superior alternatives.
  • LTE is More Robust: The LTE model demonstrates a greater ability to drive the diffusion of a superior alternative, especially when the initial adoption is low or when the superior product faces compatibility challenges.
  • Long-Term vs. Short-Term Trade-off: The trust limit parameter (δ') effectively balances the player's sensitivity to immediate utility versus long-term social welfare, influencing diffusion outcomes. Higher trust limits generally favor the superior alternative.
  • Markov Chain as a Predictive Tool: The developed Markov chain model, based on mean-field approximation, provides accurate estimates for the absorption probability (domination likelihood) and expected time to equilibrium, especially for regular graphs. This is valuable for managerial decision-making.
  • Bridging Game Theory and Epidemic Models: The connection established between the game-theoretic LTE model and the epidemic-based Linear Threshold model offers a unified perspective on diffusion dynamics.

Key Results

  • Improved Utility: Simulations show that players adopting the LTE model gain substantially more utility over time compared to those following the NE model, especially as the trust limit increases.
  • Faster Diffusion of Superior Alternatives: In many scenarios, particularly when the superior alternative has compatibility issues or low initial adoption, the LTE model leads to its dominance, whereas the NE model might result in its failure.
  • Accurate Predictions: The Markov chain analysis accurately predicts the diffusion outcomes (absorption probability and time to equilibrium) observed in simulations, particularly for regular graphs. For instance, in Figure 5, the simulated diffusion curves closely align with the absorption probability and expected time to absorption predicted by the Markov chain.
  • Robustness to Initial Conditions: LTE diffusion is less sensitive to the number of initial adopters compared to NE diffusion, often leading to the superior alternative's success even with limited initial support.

Limitations and Future Work

  • Assumptions on Trust: The model assumes a specific form of "limited trust" and a uniform trust limit across all neighbors for a given player. Future work could explore heterogeneous trust levels or more complex trust dynamics.
  • Synchronous vs. Asynchronous Updates: While the paper analyzes both, the equivalence between BR-LTE and LT-LTE models is shown for synchronous updates. Further investigation into asynchronous updates in this context could be beneficial.
  • Network Structure: While the Markov chain analysis works well for regular graphs, its accuracy for more complex, high-dimensional networks with heterogeneous degree distributions might be less precise when absorption probabilities are not close to 0 or 1.
  • Future Directions: The authors suggest exploring scenarios where only a portion of agents exhibit trustworthy behavior and investigating how to obtain high-probability bounds for the convergence time of LTE diffusion. They also mention the potential for extending the analysis to more complex network structures and diffusion processes.

Summary updated

Abstract

We consider the diffusion of two alternatives in social networks using a game-theoretic approach. Each individual plays a coordination game with its neighbors repeatedly and decides which to adopt. As products are used in conjunction with others and through repeated interactions, individuals are more interested in their long-term benefits and tend to show trust to others to maximize their long-term utility by choosing a suboptimal option with respect to instantaneous payoff. To capture such trust behavior, we deploy limited-trust equilibrium (LTE) in diffusion process. We analyze the convergence of emerging dynamics to equilibrium points using mean-field approximation and study the equilibrium state and the convergence rate of diffusion using absorption probability and expected absorption time of a reduced-size absorbing Markov chain. We also show that the diffusion model on LTE under the best-response strategy can be converted to the well-known linear threshold model. Simulation results show that when agents behave trustworthy, their long-term utility will increase significantly compared to the case when they are solely self-interested. Moreover, the Markov chain analysis provides a good estimate of convergence properties over random networks.
BibTeX
@article{leon2024limited,
  author = {Vincent Léon and S. Rasoul Etesami and Rakesh Nagi},
  title = {{Limited-Trust in Diffusion of Competing Alternatives Over Social Networks}},
  journal = {IEEE Trans. Network Science \& Engineering},
  year = {2024},
  doi = {10.1109/tnse.2023.3322132},
}
Figure