2005
DOI: 10.1016/j.geb.2004.08.004
|View full text |Cite
|
Sign up to set email alerts
|

Strongly stable networks

Abstract: We analyze the formation of networks among individuals. In particular, we examine the existence of networks that are stable against changes in links by any coalition of individuals. We show that to investigate the existence of such strongly stable networks one can restrict focus on a component-wise egalitarian allocation of value. We show that when such strongly stable networks exist they coincide with the set of efficient networks (those maximizing the total productive value). We show that the existence of st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
57
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 218 publications
(64 citation statements)
references
References 18 publications
0
57
0
Order By: Relevance
“…Networks immune to such Pareto improving deviations are weakly Pareto efficient. We will be interested here in weakly Pareto efficient Nash networks and Pareto efficient Nash equilibria (PENE) -both notions are closely related to the notions of strong equilibria and strong stability introduced by Jackson and van den Nouweland (2005). In fact, in two-player games of network formation, the set of strong equilibria is the same as the set of weakly Pareto efficient Nash equilibria 4 .…”
Section: Rules Of Network Formationmentioning
confidence: 99%
“…Networks immune to such Pareto improving deviations are weakly Pareto efficient. We will be interested here in weakly Pareto efficient Nash networks and Pareto efficient Nash equilibria (PENE) -both notions are closely related to the notions of strong equilibria and strong stability introduced by Jackson and van den Nouweland (2005). In fact, in two-player games of network formation, the set of strong equilibria is the same as the set of weakly Pareto efficient Nash equilibria 4 .…”
Section: Rules Of Network Formationmentioning
confidence: 99%
“…Hence, a legitimate counterargument to network analysis could be that such an approach is unnecessary since network characteristics are simply a direct consequence of conventional attributional data and therefore do not contain additional independent information. However, extensive work has gone into understanding the process of network formation and the conditions for the existence, uniqueness, and stability of network equilibria (see, for example, Bala and Goyal 2000;Jackson and Watts 2002;Jackson and van den Nouweland 2005), and one of the implications of this body of literature is that one-to-one correspondences between sets of unit-specific attributes and specific network structures may not exist (that is, not all tall children are considered popular, or height may not be as relevant an attribute in particular networks). Therefore, in most applications network analysis is bound to add value above and beyond what attributional data can tell us.…”
Section: Network Analysis and Market Prestigementioning
confidence: 99%
“…The survey article in [11] presents the most notable works on network formation in cooperative games; furthermore, the existence of networks that are stable against changes in link choices by any coalition is studied in [13]. In [14], Andelman et al analyze strong equilibria with respect to players' scheduling as well as a different class of network creation games in which links may be formed between any pair of agents.…”
Section: Related Workmentioning
confidence: 99%