Skip to main content
Log in

Opinion Formation with Imperfect Agents as an Evolutionary Process

  • Published:
Computational Economics Aims and scope Submit manuscript

Abstract

We develop and simulate an interaction-based model of continuous opinion formation under bounded confidence to identify conditions and understand circumstances that lead a society into either a consensus, multiple opinion classes or perpetual opinion dynamics. The society is modeled as a social network and random meetings are presumed. When only regular agents are present, we have shown that the small world networks may bring the society very close to consensus for even small threshold levels, but require higher tolerance than the complete network to reach consensus. We have identified the conditions under which the process with stubborn agents generates long-run consensus, permanent disagreement or permanent fluctuation in opinions. There cannot be a persistent fluctuation in opinions in the environment of regular agents nor in the presence of a single group of stubborn agents. In the runs with a single group of stubborn extremists, we have identified the Popper paradox despite the existence of a tolerance span in which the proportion of extremism decreases as the tolerance level increases. Further, in a highly tolerant society with two competing extremist groups, they have no supporters among the regular agents whose opinions are oscillating around the center of the opinion space. The influence of inconsistent agents is persistent and induces a perpetual opinion dynamics. The model is non-equilibrium and emerging, while consensus, if attainable, can be reached in a finite time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. Not only are individuals’ opinions different, in some instances they are even contrasting (Hayek 1945).

  2. This assumption is grounded on the premise that opinions are not true or false in the way the logical statements are but are essentially subjective and agents’ private information. Therefore, no such objective metric exists, which would allow an agent to check the correctness of his opinion. Hence, everyone is right (or wrong) in his own way.

  3. Stubborn agents cannot be persuaded but can persuade others (Katz and Lazarsfeld 1955).

  4. Stubborn agents may be seen as opinion leaders, while insincere agents could also be referred to as misbehaving or faulty agents.

  5. Network-based models of opinion formation have largely developed within two broad categories. In the discrete opinion models, an individual has to choose from a given number of alternatives (voter model, Ising model, etc.). In continuous opinion models, the opinion is represented by a real number for which communication can bring some unique opinions which were non-existent before. This is not possible in discrete models. See Galam (2008), Castellano et al. (2009), Acemoglu and Ozdaglar (2011) and Young and Zamir (2015) for an overview of the recent models. We are concerned with continuous opinions.

  6. Even though the models of opinion dynamics usually presume an honest individual, this sort of uncertainty, i.e. misbehaving parts and component failures, has been regularly used in explaining the behavior of distributed systems in some other disciplines (Fischer et al. 1985; Lamport et al. 1982; LeBlanc et al. 2012; Marti et al. 2000; Pasqualetti et al. 2012; Ren and Beard 2005).

  7. The network is a mathematical representation of a society. For a thorough overview of the social network concepts, we refer the reader to Wasserman and Faust (1994) and Jackson (2010).

  8. This excludes the cases in which John would intentionally call for Peter, asking him for the advice, as well as the cases in which he would want to avoid certain counterparts with adverse opinions or undesired characteristics Gentzkow and Shapiro (2011).

  9. The idea of bounded confidence suggests that people ignore individuals with whom they largely disagree.

  10. The maximum number of opinion classes corresponds to the number of agents. Initially, we presume a pluralistic society.

  11. The same is true if \(x_{i,t}, x_{j,t} < x^{*}\).

  12. Uniform distribution of initial opinions was confirmed with the Kolmogorov–Smirnov test (p value  =  0.1108); \(\overline{x}_0 = 0.5\).

  13. We should note that unique opinions in single repetitions do not mean that these opinions are always the same.

  14. The small world network can be described as the set of small and connected communities with high local clustering in which agents have equal average topological features. Degree distribution in the scale free network exhibits a power law, which means that there are a few agents with many more links than others (Barabási and Albert 1999).

  15. Node degree determines the average size of the neighborhood (premise 2). We examine the cases with \(k=10, 20, 30, 50\). Names of the networks: SW10, SW20, SW30 and SW50 denote the average node degree of the corresponding small world network. In all small world networks, each link is randomly rewired with probability of 5%.

  16. Stubborn agents should not be confused with extremists, per se. Stubbornness relate to the willingness to change the opinion, while the extremism relates to the (extreme) position of an opinion on the opinion scale. Extremists are agents with opinions close to zero or one, while stubborn agents are those with \(\epsilon =0\). However, we have hinted that extremists may also be more convinced individuals, reflecting the behavior of the stubborn agents.

  17. The assumption of sincere agents is certainly valid for some individuals but, generally, it does not match the conclusions from behavioral science which provides plenty of evidence that real-world agents are all but perfect [see Hirshleifer (2001) for an overview].

References

  • Acemoglu, D., & Ozdaglar, A. (2011). Opinion dynamics and learning in social networks. Dynamic Games and Applications, 1(1), 3–49.

    Article  Google Scholar 

  • Acemoglu, D., Ozdaglar, A., & ParandehGheibi, A. (2010). Spread of (mis) information in social networks. Games and Economic Behavior, 70(2), 194–227.

    Article  Google Scholar 

  • Acemoglu, D., Como, G., Fagnani, F., & Ozdaglar, A. (2013). Opinion fluctuations and disagreement in social networks. Mathematics of Operations Research, 38(1), 1–27.

    Article  Google Scholar 

  • Albert, R., Jeong, H., & Barabási, A. L. (2000). Error and attack tolerance of complex networks. Nature, 406(6794), 378–382.

    Article  Google Scholar 

  • Altafini, C. (2013). Consensus problems on networks with antagonistic interactions. IEEE Transactions on Automatic Control, 58(4), 935–946.

    Article  Google Scholar 

  • Axelrod, R. (1997). The dissemination of culture a model with local convergence and global polarization. Journal of Conflict Resolution, 41(2), 203–226.

    Article  Google Scholar 

  • Bala, V., & Goyal, S. (1998). Learning from neighbours. Review of Economic Studies, 65(3), 595–621.

    Article  Google Scholar 

  • Banerjee, A., & Fudenberg, D. (2004). Word-of-mouth learning. Games and Economic Behavior, 46(1), 1–22.

    Article  Google Scholar 

  • Barabási, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509–512.

    Article  Google Scholar 

  • Baronchelli, A., Loreto, V., & Steels, L. (2008). In-depth analysis of the naming game dynamics: The homogeneous mixing case. International Journal of Modern Physics C, 19(05), 785–812.

    Article  Google Scholar 

  • Ben-Naim, E. (2005). Opinion dynamics: Rise and fall of political parties. EPL (Europhysics Letters), 69(5), 671–677.

    Article  Google Scholar 

  • Blondel, V. D., Hendrickx, J. M., & Tsitsiklis, J. N. (2009). On Krause’s multi-agent consensus model with state-dependent connectivity. IEEE Transactions on Automatic Control, 54(11), 2586–2597.

    Article  Google Scholar 

  • Blume, L. E. (1993). The statistical mechanics of strategic interaction. Games and Economic Behavior, 5(3), 387–424.

    Article  Google Scholar 

  • Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., & Hwang, D. U. (2006). Complex networks: Structure and dynamics. Physics Reports, 424(4), 175–308.

    Article  Google Scholar 

  • Boccaletti, S., Bianconi, G., Criado, R., Del Genio, C. I., Gómez-Gardenes, J., Romance, M., et al. (2014). The structure and dynamics of multilayer networks. Physics Reports, 544(1), 1–122.

    Article  Google Scholar 

  • Burnside, C., Eichenbaum, M., & Rebelo, S. (2011). Understanding booms and busts in housing markets. Working Paper 16734, National Bureau of Economic Research.

  • Castellano, C., Fortunato, S., & Loreto, V. (2009). Statistical physics of social dynamics. Reviews of Modern Physics, 81, 591–646.

    Article  Google Scholar 

  • Deffuant, G., Neau, D., Amblard, F., & Weisbuch, G. (2000). Mixing beliefs among interacting agents. Advances in Complex Systems, 3(01n04), 87–98.

    Article  Google Scholar 

  • Deffuant, G., Amblard, F., Weisbuch, G., & Faure, T. (2002). How can extremism prevail? A study based on the relative agreement interaction model. Journal of Artificial Societies and Social Simulation, 5(4). http://jasss.soc.surrey.ac.uk/5/4/1.html.

  • DeGroot, M. H. (1974). Reaching a consensus. Journal of the American Statistical Association, 69(345), 118–121.

    Article  Google Scholar 

  • DeMarzo, P. M., Vayanos, D., & Zwiebel, J. (2003). Persuasion bias, social influence, and unidimensional opinions. Quarterly Journal of Economics, 118(3), 909–968.

    Article  Google Scholar 

  • Dutta, B., & Sen, A. (2012). Nash implementation with partially honest individuals. Games and Economic Behavior, 74(1), 154–169.

    Article  Google Scholar 

  • Eliaz, K. (2002). Fault tolerant implementation. Review of Economic Studies, 69(3), 589–610.

    Article  Google Scholar 

  • Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985). Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2), 374–382.

    Article  Google Scholar 

  • Galam, S. (2004). Contrarian deterministic effects on opinion dynamics:the hung elections scenario. Physica A: Statistical Mechanics and its Applications, 333, 453–460.

    Article  Google Scholar 

  • Galam, S. (2008). Sociophysics: A review of galam models. International Journal of Modern Physics C, 19(3), 409–440.

    Article  Google Scholar 

  • Gale, D., & Kariv, S. (2003). Bayesian learning in social networks. Games and Economic Behavior, 45(2), 329–346.

    Article  Google Scholar 

  • Gentzkow, M., & Shapiro, J. M. (2011). Ideological segregation online and offline. Quarterly Journal of Economics, 126(4), 1799–1839.

    Article  Google Scholar 

  • Glaeser, E. L., Sacerdote, B., & Scheinkman, J. A. (1996). Crime and social interactions. Quarterly Journal of Economics, 111(2), 507–548.

    Article  Google Scholar 

  • Golub, B., & Jackson, M. O. (2010). Naïve learning in social networks and the wisdom of crowds. American Economic Journal Microeconomics, 2(1), 112–149.

    Article  Google Scholar 

  • Granovetter, M. (1978). Threshold models of collective behavior. American Journal of Sociology, 83(6), 1420–1443.

    Article  Google Scholar 

  • Granovetter, M. (1995). Getting a job: A study of contacts and careers. Chicago: University of Chicago Press.

    Book  Google Scholar 

  • Gruhl, D., Guha, R., Liben-Nowell, D., & Tomkins, A. (2004). Information diffusion through blogspace. In Proceedings of the 13th international conference on world wide web, ACM, WWW ’04 (pp. 491–501).

  • Hayek, F. (1945). The use of knowledge in society. American Economic Review, 35(4), 519–530.

    Google Scholar 

  • Hegselmann, R., & Krause, U. (2002). Opinion dynamics and bounded confidence models, analysis, and simulation. Journal of Artificial Societies and Social Simulation, 5(3). http://jasss.soc.surrey.ac.uk/5/3/2.html.

  • Hegselmann, R., & Krause, U. (2005). Opinion dynamics driven by various ways of averaging. Computational Economics, 25(4), 381–405.

    Article  Google Scholar 

  • Hirshleifer, D. (2001). Investor psychology and asset pricing. Journal of Finance, 56(4), 1533–1597.

    Article  Google Scholar 

  • Jackson, M. O. (2010). Social and economic networks. Princeton: Princeton University Press.

    Book  Google Scholar 

  • Jadbabaie, A., Lin, J., & Morse, A. S. (2003). Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6), 988–1001.

    Article  Google Scholar 

  • Jadbabaie, A., Molavi, P., Sandroni, A., & Tahbaz-Salehi, A. (2012). Non-Bayesian social learning. Games and Economic Behavior, 76(1), 210–225.

    Article  Google Scholar 

  • Katz, E., & Lazarsfeld, P. F. (1955). Personal influence, the part played by people in the flow of mass communications. New York, NY: The Free Press.

    Google Scholar 

  • Kauffman, S. (1993). The origins of order: Self-organization and selection in evolution. Oxford: Oxford University Press.

    Google Scholar 

  • Kempe, D., Kleinberg, J., & Tardos, É. (2003). Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, ACM (pp. 137–146).

  • Krapivsky, P. L., & Redner, S. (2003). Dynamics of majority rule in two-state interacting spin systems. Physical Review Letters, 90(23), 238,701.

    Article  Google Scholar 

  • Kwak, H., Lee, C., Park, H., & Moon, H. (2010). What is twitter, a social network or a news media? In Proceedings of the 19th international conference on world wide web, ACM, WWW ’10 (pp. 591–600).

  • Lamport, L., Shostak, R., & Pease, M. (1982). The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3), 382–401.

    Article  Google Scholar 

  • LeBlanc, H. J., Zhang, H., Sundaram, S., & Koutsoukos, X. (2012). Consensus of multi-agent networks in the presence of adversaries using only local information. In Proceedings of the 1st international conference on high confidence networked systems, ACM (pp. 1–10).

  • Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007). The dynamics of viral marketing. ACM Transactions on the Web (TWEB), 1(1), 5.

    Article  Google Scholar 

  • Lorenz, J. (2010). Heterogeneous bounds of confidence: Meet, discuss and find consensus!. Complexity, 15(4), 43–52.

    Google Scholar 

  • Marti, S., Giuli, T.J., Lai, K., & Baker, M. (2000). Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the 6th annual international conference on mobile computing and networking, ACM (pp. 255–265).

  • Motsch, S., & Tadmor, E. (2014). Heterophilious dynamics enhances consensus. SIAM Review, 56(4), 577–621.

    Article  Google Scholar 

  • Newman, M. E. (2002). Spread of epidemic disease on networks. Physical Review E, 66(1), 016,128.

    Article  Google Scholar 

  • Nowak, M. A., & May, R. M. (1992). Evolutionary games and spatial chaos. Nature, 359(6398), 826–829.

    Article  Google Scholar 

  • Olfati-Saber, R., & Murray, R. M. (2004). Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 49(9), 1520–1533.

    Article  Google Scholar 

  • Pasqualetti, F., Bicchi, A., & Bullo, F. (2012). Consensus computation in unreliable networks: A system theoretic approach. IEEE Transactions on Automatic Control, 57(1), 90–104.

    Article  Google Scholar 

  • Pastor-Satorras, R., & Vespignani, A. (2001). Epidemic spreading in scale-free networks. Physical Review Letters, 86, 3200–3203.

    Article  Google Scholar 

  • Popper, K. (1945). The open society and its enemies. London: Routledge.

    Google Scholar 

  • Ren, W., & Beard, R. W. (2005). Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control, 50(5), 655–661.

    Article  Google Scholar 

  • Schelling, T. (1971). Dynamic models of segregation. Journal of Mathematical Sociology, 1(2), 143–186.

    Article  Google Scholar 

  • Sood, V., & Redner, S. (2005). Voter model on heterogeneous graphs. Physical Review Letters, 94(17), 178,701.

    Article  Google Scholar 

  • Szabó, G., & Fath, G. (2007). Evolutionary games on graphs. Physics Reports, 446(4), 97–216.

    Article  Google Scholar 

  • Sznajd-Weron, K., & Sznajd, J. (2000). Opinion evolution in closed community. International Journal of Modern Physics C, 11(06), 1157–1165.

    Article  Google Scholar 

  • Tesfatsion, L., & Judd, K. (2006). Handbook of computational economics: Agent-based computational economics. Amsterdam: North Holland.

    Google Scholar 

  • Valente, T. W. (1995). Network models of the diffusion of innovations. New York: Hampton Press Cresskill.

    Google Scholar 

  • Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995). Novel type of phase transition in a system of self-driven particles. Physical Review Letters, 75(6), 1226.

    Article  Google Scholar 

  • Ward, A. J., Sumpter, D. J., Couzin, I. D., Hart, P. J., & Krause, J. (2008). Quorum decision-making facilitates information transfer in fish shoals. Proceedings of the National Academy of Sciences, 105(19), 6948–6953.

    Article  Google Scholar 

  • Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Watts, D. J., & Dodds, P. S. (2007). Influentials, networks, and public opinion formation. Journal of Consumer Research, 34(4), 441–458.

    Article  Google Scholar 

  • Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of small-world networks. Nature, 393(6684), 440–442.

    Article  Google Scholar 

  • Weisbuch, G., Deffuant, G., Amblard, F., & Nadal, J. P. (2002). Meet, discuss, and segregate!. Complexity, 7(3), 55–63.

    Article  Google Scholar 

  • Young, H. P., & Zamir, S. (2015). Handbook of game theory with economic applications (Vol. 4). Amsterdam: Elsevier.

    Google Scholar 

Download references

Acknowledgements

The algorithm is written in C++ (compiled for 64-bit Visual Studio 12). The source code is available at https://github.com/pixlifai/opiform. The authors would like to thank seminar participants at the Fifth World Congress of the Game Theory Society (GAMES 2016), Maastricht, the Netherlands, July 24–28, 2016, and the 22nd Annual Workshop on Economic Science with Heterogeneous Interacting Agents (WEHIA 2017), Milan, Italy, June 12–14, 2017, for helpful comments and suggestions. We also thank two anonymous referees who made a number of helpful comments and suggestions. All errors remain the responsibility of the authors.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mitja Steinbacher.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Steinbacher, M., Steinbacher, M. Opinion Formation with Imperfect Agents as an Evolutionary Process. Comput Econ 53, 479–505 (2019). https://doi.org/10.1007/s10614-017-9751-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10614-017-9751-z

Keywords

Navigation