IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04733885.html
   My bibliography  Save this paper

Influence and Counter-Influence in Networks
[Mécanismes d'influence et de contre-influence dans les réseaux]

Author

Listed:
  • Christophe Bravard

    (GAEL - Laboratoire d'Economie Appliquée de Grenoble - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement - UGA - Université Grenoble Alpes - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - UGA - Université Grenoble Alpes)

  • Jacques Durieu

    (CREG - Centre de recherche en économie de Grenoble - UGA - Université Grenoble Alpes)

  • Sudipta Sarangi

    (Virginia Tech [Blacksburg])

  • Corinne Touati

    (Centre Inria de l'Université Grenoble Alpes - Inria - Institut National de Recherche en Informatique et en Automatique)

Abstract

We study influence competition between two players: a designer who can shape the pattern of interaction between a set of agents and influence them, and an adversary who can counter-influence these agents. Creating the network and influencing agents are both costly activities for the two players. The final opinion and the vote of the agents depend on how the two players influence them as well as the opinion of their neighbors. Agent votes determine the payoffs of the two players and to win the designer must obtain the vote of all the agents. We begin by assuming that the designer has the better influence technology, and subsequently relax this assumption. We find that optimal strategies depend on the different costs incurred by the players, as well as who has the advantage in influence technology. We also study what happens when links between agents can arise randomly with a known exogenous probability, taking away some of the designer's control over the network. We provide conditions under which the results of the benchmark model are preserved. Next, we modify two additional assumptions: (1) requiring the designer to only secure a majority of the votes, and (2) allowing the agents interact for several rounds before casting the final vote. In both cases, the designer needs fewer resources to win the game.

Suggested Citation

  • Christophe Bravard & Jacques Durieu & Sudipta Sarangi & Corinne Touati, 2024. "Influence and Counter-Influence in Networks [Mécanismes d'influence et de contre-influence dans les réseaux]," Post-Print hal-04733885, HAL.
    • Handle: RePEc:hal:journl:hal-04733885
    Note: View the original document on HAL open archive server: https://inria.hal.science/hal-04733885v1
    as

    Download full text from publisher

    File URL: https://inria.hal.science/hal-04733885v1/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kris De Jaegher & Britta Hoyer, 2016. "Collective action and the common enemy effect," Defence and Peace Economics, Taylor & Francis Journals, vol. 27(5), pages 644-664, September.
    2. Antonio Cabrales & Piero Gottardi & Fernando Vega-Redondo, 2017. "Risk Sharing and Contagion in Networks," The Review of Financial Studies, Society for Financial Studies, vol. 30(9), pages 3086-3127.
    3. Bravard, Christophe & Charroin, Liza & Touati, Corinne, 2017. "Optimal design and defense of networks under link attacks," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 62-79.
    4. Francis Bloch & Gabrielle Demange & Rachel Kranton, 2018. "Rumors And Social Networks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 59(2), pages 421-448, May.
    5. Sanjeev Goyal & Adrien Vigier, 2014. "Attack, Defence, and Contagion in Networks," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1518-1542.
    6. Mariagiovanna Baccara & Heski Bar-Isaac, 2008. "How to Organize Crime -super-1," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 75(4), pages 1039-1067.
    7. Acemoglu, Daron & Malekian, Azarakhsh & Ozdaglar, Asu, 2016. "Network security and contagion," Journal of Economic Theory, Elsevier, vol. 166(C), pages 536-585.
    8. Bravard, Christophe & Durieu, Jacques & Sarangi, Sudipta & Sémirat, Stéphan, 2023. "False information from near and far," Games and Economic Behavior, Elsevier, vol. 137(C), pages 152-174.
    9. Dziubiński, Marcin Konrad & Goyal, Sanjeev, 2017. "How do you defend a network?," Theoretical Economics, Econometric Society, vol. 12(1), January.
    10. Dziubiński, Marcin & Goyal, Sanjeev, 2013. "Network design and defence," Games and Economic Behavior, Elsevier, vol. 79(C), pages 30-43.
    11. Matthew O. Jackson & Leeat Yariv, 2007. "Diffusion of Behavior and Equilibrium Properties in Network Games," American Economic Review, American Economic Association, vol. 97(2), pages 92-98, May.
    12. Christophe Bravard & Liza Charroin & Corinne Touati, 2016. "Optimal design and defense of networks under link attacks," Post-Print halshs-01411534, HAL.
    13. Lauren Cohen & Christopher J. Malloy, 2014. "Friends in High Places," American Economic Journal: Economic Policy, American Economic Association, vol. 6(3), pages 63-91, August.
    14. repec:oup:restud:v:81:y:2014:i:4:p:1518-1542. is not listed on IDEAS
    15. Michel Grabisch & Antoine Mandel & Agnieszka Rusinowska & Emily Tanimura, 2018. "Strategic Influence in Social Networks," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 29-50, February.
    16. Haller, Hans & Hoyer, Britta, 2019. "The common enemy effect under strategic network formation and disruption," Journal of Economic Behavior & Organization, Elsevier, vol. 162(C), pages 146-163.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bravard, Christophe & Charroin, Liza & Touati, Corinne, 2017. "Optimal design and defense of networks under link attacks," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 62-79.
    2. Britta Hoyer & Kris De Jaegher, 2023. "Network disruption and the common-enemy effect," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 117-155, March.
    3. Marcin Dziubinski & Sanjeev Goyal & Adrien Vigier, 2015. "Conflict and Networks," Cambridge Working Papers in Economics 1565, Faculty of Economics, University of Cambridge.
    4. Daniel Woods & Mustafa Abdallah & Saurabh Bagchi & Shreyas Sundaram & Timothy Cason, 2022. "Network defense and behavioral biases: an experimental study," Experimental Economics, Springer;Economic Science Association, vol. 25(1), pages 254-286, February.
    5. Bloch, Francis & Dutta, Bhaskar & Dziubiński, Marcin, 2020. "A game of hide and seek in networks," Journal of Economic Theory, Elsevier, vol. 190(C).
    6. Belhaj, Mohamed & Deroïan, Frédéric, 2018. "Targeting the key player: An incentive-based approach," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 57-64.
    7. Alessandro Fedele & Cristian Roner, 2022. "Dangerous games: A literature review on cybersecurity investments," Journal of Economic Surveys, Wiley Blackwell, vol. 36(1), pages 157-187, February.
    8. Dan Kovenock & Brian Roberson, 2018. "The Optimal Defense Of Networks Of Targets," Economic Inquiry, Western Economic Association International, vol. 56(4), pages 2195-2211, October.
    9. Djawadi, Behnud Mir & Endres, Angelika & Hoyer, Britta & Recker, Sonja, 2019. "Network formation and disruption - An experiment are equilibrium networks too complex?," Journal of Economic Behavior & Organization, Elsevier, vol. 157(C), pages 708-734.
    10. Marcin Dziubinski & Sanjeev Goyal, 2014. "How to Defend a Network?," Cambridge Working Papers in Economics 1450, Faculty of Economics, University of Cambridge.
    11. Cerdeiro, Diego & Dziubinski, Marcin & Goyal, Sanjeev, 2015. "Contagion Risk and Network Design," Climate Change and Sustainable Development 206416, Fondazione Eni Enrico Mattei (FEEM).
    12. Michel Grabisch & Agnieszka Rusinowska & Xavier Venel, 2019. "Diffusion in countably infinite networks," Documents de travail du Centre d'Economie de la Sorbonne 19017, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    13. Dziubiński, Marcin Konrad & Goyal, Sanjeev, 2017. "How do you defend a network?," Theoretical Economics, Econometric Society, vol. 12(1), January.
    14. Manxi Wu & Saurabh Amin, 2019. "Securing Infrastructure Facilities: When Does Proactive Defense Help?," Dynamic Games and Applications, Springer, vol. 9(4), pages 984-1025, December.
    15. Goyal, S., 2016. "Networks and Markets," Cambridge Working Papers in Economics 1652, Faculty of Economics, University of Cambridge.
    16. Haller, Hans & Hoyer, Britta, 2019. "The common enemy effect under strategic network formation and disruption," Journal of Economic Behavior & Organization, Elsevier, vol. 162(C), pages 146-163.
    17. Bloch, Francis & Chatterjee, Kalyan & Dutta, Bhaskar, 2023. "Attack and interception in networks," Theoretical Economics, Econometric Society, vol. 18(4), November.
    18. Mohamed Belhaj & Frédéric Deroïan, 2016. "The Value of Network Information: Assortative Mixing Makes the Difference," AMSE Working Papers 1618, Aix-Marseille School of Economics, France, revised 11 May 2016.
    19. Tackseung Jun & Jeong-Yoo Kim, 2020. "A Note on Connectivity and Stability in Dynamic Network Formation," Games, MDPI, vol. 11(4), pages 1-10, October.
    20. Cerdeiro, Diego A. & Dziubiński, Marcin & Goyal, Sanjeev, 2017. "Individual security, contagion, and network design," Journal of Economic Theory, Elsevier, vol. 170(C), pages 182-226.

    More about this item

    Keywords

    Network design; Opinion dynamics; Influence networks;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-04733885. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.