Dominance of weighted nested split graph networks in connections models
Norma Olaizola () and
Federico Valenciano ()
Additional contact information
Norma Olaizola: Universidad del País Vasco
International Journal of Game Theory, 2020, vol. 49, issue 1, No 4, 75-96
Abstract:
Abstract In this paper, we address the question of the efficiency of weighted networks in a setting where nodes derive utility from their direct and indirect connections. Under rather general conditions, based on a set of assumptions about the value that connections in a weighted network generate, and about link-formation technology, we prove that any network is dominated by a special type of nested split graph weighted network. These conditions include some of the models in the literature, which are particular cases of this general model.
Keywords: Weighted network; Efficiency; Nested split graph (search for similar items in EconPapers)
JEL-codes: A14 C72 D85 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://link.springer.com/10.1007/s00182-019-00676-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:49:y:2020:i:1:d:10.1007_s00182-019-00676-2
Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2
DOI: 10.1007/s00182-019-00676-2
Access Statistics for this article
International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel
More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().