Dominance of weighted nested split graph networks in connections models

DOI10.1007/S00182-019-00676-2zbMATH Open1437.91105OpenAlexW2944415597MaRDI QIDQ2178640FDOQ2178640

Authors: Norma Olaizola, Federico Valenciano 

Publication date: 11 May 2020

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-019-00676-2

Recommendations

• A model of weighted network formation
• Nestedness in networks: A theoretical model and some applications
• Efficient networks in games with local complementarities
• Efficient network structures with separable heterogeneous connection costs
• scientific article; zbMATH DE number 5811565

zbMATH Keywords

efficiencyweighted networknested split graph

Mathematics Subject Classification ID

Games involving graphs (91A43)

Cites Work

• Who's Who in Networks. Wanted: The Key Player
• A strategic model of social and economic networks
• Networks of collaboration in oligopoly.
• A Noncooperative Model of Network Formation
• Peer effects in endogenous networks
• Strategic complementarities, network games and endogenous network formation
• Nestedness in networks: A theoretical model and some applications
• Communication networks with endogenous link strength
• The efficiency and stability of R\&D networks
• Efficient networks in games with local complementarities
• Efficient networks for a class of games with global spillovers
• Social activity and network formation
• A unifying model of strategic network formation

Cited In (2)

• Core-periphery and nested networks emerging from a simple model of network formation
• Designing weighted and directed networks under complementarities

This page was built for publication: Dominance of weighted nested split graph networks in connections models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178640)