IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-01212128.html

Efficient networks for a class of games with global spillovers

Author

Listed:
  • Pascal Billand

    (UGA [2016-2019] - Université Grenoble Alpes [2016-2019], GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université 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

    (GAEL - Laboratoire d'Economie Appliquée = Grenoble Applied Economics Laboratory - UPMF - Université Pierre Mendès France - Grenoble 2 - INRA - Institut National de la Recherche Agronomique)

  • Jacques Durieu

    (CREG - Centre de recherche en économie de Grenoble - UPMF - Université Pierre Mendès France - Grenoble 2)

  • Sudipta Sarangi

    (LSU - Louisiana State University [BatonRouge], DIW Berlin - Deutsches Institut für Wirtschaftsforschung)

Abstract

In this paper we examine efficient networks in network formation games with global spillovers that satisfy convexity and sub-modularity properties. Unlike the previous literature we impose these properties on individual payoff functions. We establish that efficient networks of this class of games are nested split graphs. This allows us to complete the work of Goyal and Joshi (2006) and Westbrock (2010) on collaborative oligopoly networks.

Suggested Citation

  • Pascal Billand & Christophe Bravard & Jacques Durieu & Sudipta Sarangi, 2015. "Efficient networks for a class of games with global spillovers," Post-Print halshs-01212128, HAL.
    • Handle: RePEc:hal:journl:halshs-01212128
    DOI: 10.1016/j.jmateco.2015.06.019
    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
    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. Pascal Billand & Christophe Bravard & Jacques Durieu & Sudipta Sarangi, 2019. "Firm Heterogeneity And The Pattern Of R&D Collaborations," Economic Inquiry, Western Economic Association International, vol. 57(4), pages 1896-1914, October.
    2. Grandjean, G. & Tellone, D. & Vergote, W., 2016. "Cooperation, Competition and Entry in a Tullock Contest," LIDAM Discussion Papers CORE 2016032, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Alan Griffith, 2025. "Efficiency in the two-way connections model," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(2), pages 1-46, December.
    4. Zenou, Yves & Lindquist, Matthew & Sauermann, Jan, 2015. "Network Effects on Worker Productivity," CEPR Discussion Papers 10928, C.E.P.R. Discussion Papers.
    5. Bravard, Christophe & Sarangi, Sudipta & Tzavellas, Hector, 2025. "Group dominant networks and convexity," Journal of Mathematical Economics, Elsevier, vol. 118(C).
    6. Belhaj, Mohamed & Bervoets, Sebastian & Deroïan, Frédéric, 2016. "Efficient networks in games with local complementarities," Theoretical Economics, Econometric Society, vol. 11(1), January.
    7. Yang Sun & Wei Zhao & Junjie Zhou, 2024. "Sequential Network Design," Papers 2409.14136, arXiv.org, revised Nov 2025.
    8. repec:ehu:ikerla:24730 is not listed on IDEAS
    9. Qiang Gong & Huanxing Yang, 2020. "Collaborative Networks in Oligopoly with Asymmetric Firms," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 56(2), pages 357-380, March.
    10. Hiller, Timo, 2022. "A simple model of network formation with competition effects," Journal of Mathematical Economics, Elsevier, vol. 99(C).
    11. Norma Olaizola & Federico Valenciano, 2020. "Dominance of weighted nested split graph networks in connections models," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 75-96, March.
    12. Grandjean, G. & Tellone, D. & Vergote, W., 2017. "Endogenous network formation in a Tullock contest," Mathematical Social Sciences, Elsevier, vol. 85(C), pages 1-10.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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-01212128. 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.