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

Directed networks with spillovers

Author

Listed:
  • Pascal Billand

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

  • Christophe Bravard

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

  • Sudipta Sarangi

    (Department of Economics, Louisiana State University - LSU - Louisiana State University)

Abstract

We study noncooperative network formation in two types of directed networks. In the first type, called the model with global spillovers, the payoff of a player depends on the number of links she forms as well as the total number of links formed by all other players. In the second type, called the model with local spillovers, the payoff of a player depends on the number of links she forms and the total number of links formed by her immediate neighbors, as well as the number of links formed by players outside her neighborhood. For both classes of games we investigate the existence of pure strategy Nash equilibria and characterize the Nash networks under a number of different second order conditions on the payoff function.

Suggested Citation

  • Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2012. "Directed networks with spillovers," Post-Print halshs-00667684, HAL.
    • Handle: RePEc:hal:journl:halshs-00667684
    DOI: 10.1111/jpet.12000
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Möhlmeier, Philipp & Rusinowska, Agnieszka & Tanimura, Emily, 2018. "Competition for the access to and use of information in networks," Mathematical Social Sciences, Elsevier, vol. 92(C), pages 48-63.
    2. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Local Spillovers, Convexity and the Strategic Substitutes Property in Networks," Working Papers 1110, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    3. Currarini, Sergio & Fumagalli, Elena & Panebianco, Fabrizio, 2017. "Peer effects and local congestion in networks," Games and Economic Behavior, Elsevier, vol. 105(C), pages 40-58.
    4. Christophe Bravard & Sudipta Sarangi & PHILIPP MÖHLMEIER & AGNIESZKA RUSINOWSKA & EMILY TANIMURA, 2016. "A Degree-Distance-Based Connections Model with Negative and Positive Externalities," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 18(2), pages 168-192, April.
    5. Bougheas, Spiros, 2022. "Contagion in networks: Stability and efficiency," Mathematical Social Sciences, Elsevier, vol. 115(C), pages 64-77.

    More about this item

    Keywords

    Networks; Game theory;

    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:halshs-00667684. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.