Name
Abstract | ||
|---|---|---|
Recently, it has been shown that networks with an arbitrary degree sequence may be a stable solution to a network formation game. Further, in recent years there has been a rise in the number of firms participating in collaborative efforts. In this paper, we show conditions under which a graph with an arbitrary degree sequence is admitted as a stable firm collaboration graph. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | degree sequence |
Field | DocType | Volume |
Network formation,Graph,Oligopoly,Degree (graph theory),Collaboration graph,Collaborative network,Mathematics,Distributed computing | Journal | abs/1108.4114 |
Citations | PageRank | References |
1 | 0.43 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaun Lichter | 1 | 3 | 2.29 |
| Terry L. Friesz | 2 | 227 | 42.12 |
| Christopher Griffin | 3 | 137 | 46.28 |