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

Farsighted network formation

Abstract: This paper studies a model of dynamic network formation when individuals are farsighted : players evaluate the desirability of a "current" move in terms of its consequences on the entire discounted stream of payoffs. We define a concept of equilibrium which takes into account far-sighted behavior of agents and allows for limited cooperation amongst agents. We show that an equilibrium process of network formation exists. We also show that there are network structures in which no equilibrium strategy profile can… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
123
2
2

Year Published

2008
2008
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 190 publications
(127 citation statements)
references
References 25 publications
0
123
2
2
Order By: Relevance
“…From a more practical point of view, the theoretical literature on endogenous networks does not offer any simple way to deal with strategic network formation process and even the available results (e.g. Jackson and Watts, 2002, Page et al, 2005, and Dutta et al, 2005 are still too general to be used together with an equilibrium model of the labor market.…”
Section: Heterogenous Social Networkmentioning
confidence: 99%
“…From a more practical point of view, the theoretical literature on endogenous networks does not offer any simple way to deal with strategic network formation process and even the available results (e.g. Jackson and Watts, 2002, Page et al, 2005, and Dutta et al, 2005 are still too general to be used together with an equilibrium model of the labor market.…”
Section: Heterogenous Social Networkmentioning
confidence: 99%
“…Among the various works already carried out, we can find examples related to academic and scientific research networks (Bennett & Kidwell, 2001;Wagner & Leydesdorff, 2005), development networks of free software (Crowston et al, 2007), research and development networks in the automotive industry (Rycroft & Kash, 2004), networks of companies to improve sustainability (Espinosa & Porter, 2011), local public administration networks for economic policy development (Lee et al, 2012), networks of farmers (Dutta et al, 2005), networks of fashion industries (Schuh et al, 2008;Scherrer-Rathje et al, 2009), team management (Parker et al, 2015), among others. In all the literature reviewed, self-organizing networks were not addressed in the scope of Six Sigma programs, although there are common characteristics.…”
Section: Self-organizing Networkmentioning
confidence: 99%
“…Among the various types of collaborative networks, self-organizing networks stand out for their no centralized management, the intense participation of those involved, their ability to keep their development without significant external interference and the ability to promote the learning of all those involved in the network through the systematization and availability of the knowledge generated (Kash & Rycoft, 2000;Rycroft & Kash, 2004;Dutta et al, 2005;Wagner & Leydesdorff, 2005;Schuh et al, 2008). Gutiérrez et al (2012) claim that the Six Sigma program of an organization can be considered as a learning network, providing an organizational structure composed of a network of professionals who work together oriented towards projects.…”
Section: Introductionmentioning
confidence: 99%
“…() now denotes the shortest directed path from  to . 19 We let  ()   = f : () = g denote the set of agents with a shortest distance to agent  equal to  and  ()   = f : () = g denote the set of agents with a shortest distance from agent  equal to . Notice that the cardinality of these sets for  = 1 are the in-degree and the out-degree of node , respectively.…”
Section: Directed Networkmentioning
confidence: 99%
“…In order to keep the analysis simple we ignore such links. 19 Keep in mind that now it is most likely that () 6 = (). 20 The idea here is that both agents bene…t for forming the link.…”
Section: Directed Networkmentioning
confidence: 99%