Name
Abstract | ||
|---|---|---|
We extend the results of Goyal and Joshi (S. Goyal and S. Joshi. Networks of collaboration in oligopoly. Games and Economic behavior, 43(1):57-85, 2003), who first considered the problem of collaboration networks of oligopolies and showed that under certain linear assumptions network collaboration produced a stable complete graph through selfish competition. We show with nonlinear cost functions and player payoff alteration that stable collaboration graphs with an arbitrary degree sequence can result. We also show a generalized non-linear extension for the result in the aforementioned paper in which the complete graph is stable. An example is provided in which the complete set of pair wise stable collaborations is computed for an oligopoly consisting of five firms. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/SocialCom.2013.112 | Social Computing |
Keywords | Field | DocType |
complete graph,pairwise stable collaborative oligopolies,s. joshi,economic behavior,complete set,pair wise stable collaboration,non-linear pay-off function,stable complete graph,stable collaboration graph,aforementioned paper,s. goyal,collaboration network,game theory,oligopoly,graph theory | Network formation,Graph theory,Complete graph,Pairwise comparison,Mathematical economics,Oligopoly,Computer science,Game theory,Degree (graph theory),Stochastic game | Conference |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaun Lichter | 1 | 3 | 2.29 |
| Terry Friesz | 2 | 0 | 0.34 |
| Christopher Griffin | 3 | 137 | 46.28 |