Name
Abstract | ||
|---|---|---|
We show a simple method for constructing an infinite family of graph formation games with link bias so that the resulting games admits, as a textit{pair wise stable} solution, a graph with an arbitrarily specified degree distribution. Pair wise stability is used as the equilibrium condition over the more commonly used Nash equilibrium to prevent the occurrence of ill-behaved equilibrium strategies that do not occur in ordinary play. We construct this family of games by solving an integer programming problem whose constraints enforce the terminal pair wise stability property we desire. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/PASSAT/SocialCom.2011.61 | PASSAT) and 2011 IEEE Third Inernational Conference Social Computing |
Keywords | DocType | ISBN |
game theory,graph theory,integer programming,network theory (graphs),arbitrarily specified degree distribution,equilibrium condition,graph formation games,ill behaved equilibrium strategy,integer programming problem,link bias,pairwise stability,pairwise stable solution,Game Theory,Network Formation,Network Science | Conference | 978-1-4577-1931-8 |
Citations | PageRank | References |
0 | 0.34 | 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 |