Dominance of weighted nested split graph networks in connections models

DOI10.1007/S00182-019-00676-2MaRDI QIDQ2178640zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

efficiencyweighted networknested split graph

Mathematics Subject Classification ID

Games involving graphs (91A43)

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

Cites work

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

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)