Bounded budget betweenness centrality game for strategic network formations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5757 LNCS, Issue , 2009, Pages 227-238

  Bei, Xiaohui ^a   Chen, Wei ^b   Teng, Shang Hua ^c   Zhang, Jialin ^a   Zhu, Jiajie ^d  

^a TSINGHUA UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithmic game theory; Betweenness centrality; Nash equilibrium; Network formation game

Indexed keywords

ALGORITHMIC GAME THEORY; BEST RESPONSE; BETWEENNESS; BETWEENNESS CENTRALITY; BUDGET CONSTRAINT; EXISTENCE RESULTS; INFORMATION EXCHANGES; INFORMATION FLOWS; LINK COST; NASH EQUILIBRIA; NASH EQUILIBRIUM; NETWORK FORMATION; NETWORK FORMATION GAME; NONUNIFORM; NP-HARD; PAIRWISE COMMUNICATION; REAL-WORLD SCENARIO; SHORT-PATH; SHORTEST PATH; SOCIAL NETWORK ANALYSIS;

ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; TELECOMMUNICATION NETWORKS;

GAME THEORY;

EID: 70350397994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_20     Document Type: Conference Paper

References (19)

1. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms,pp. 89-98 (2006)
2. Bei, X., Chen, W., Teng, S.-H., Zhang, J., Zhu, J.: Bounded budget betweenness centrality game for strategic network formations, Tech. Report MSR-TR-2009-78, Microsoft Research (June 2009)
3. Berno, B.: Network formation with closeness incentives. In: Naimzada, A.K., Stefani, S., Torriero, A. (eds.) Networks, Topology and Dynamics. Springer, Heidelberg (2008)
4. Burt, R.S.: Structural holes: The social structure of competition, Harvard University Press (1992)
5. Burt, R.S.: Secondhand brokerage: Evidence on the importance of local structure for managers, bankers, and analysts. The Academy of Management Journal 50, 119-148 (2007)
6. Buskens, V., van de Rijt, A.: Dynamics of networks if everyone strives for structural holes. American Journal of Sociology 114(2), 371-407 (2008)
7. Cohen, B.: Incentives build robustness in BitTorrent. In: 1st Workshop on Economics of Peer-to-Peer Systems (2003)
8. Corbo, J., Parkes, D.C.: The price of selfish behavior in bilateral network formation. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing, pp. 99-107 (2005)
9. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd ACMSymposium on Principles of Distributed Computing,pp. 347-351 (2003)
10. Freeman, L.: Centrality in social networks: conceptual clarification. Social Networks 1, 215- 239 (1979)
11. Goyal, S., Vega-Redondo, F.: Structural holes in social networks. Journal of Economic Theory 137(1), 460-492 (2007)
12. Jackson, M., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory 71(1), 44-74 (1996)
13. Kleinberg, J., Suri, S., Tardos, É., Wexler, T.: Strategic newtwork formation with structural holes. In: Proceedings of the 9th ACM Conference on Electronic Commerce (2008)
14. Laoutaris, N., Poplawski, L., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (bbc) games or how to make friends and influence people, on a budget. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (2008)
15. Moscibroda, T., Schmid, S., Wattenhofer, R.: On the topologies formed by selfish peers. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 133-142 (2006)
16. Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Physical Review E 68, 36122 (2003)
17. Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001, Invited talk, pp. 749-753 (2001)
18. Scott, J.: Social network analysis. Sage, Thousand Oaks (1991)
19. Stutzbach, D., Sen, S.: Characterizing unstructured overlay topologies in modern p2p filesharing systems. In: ACM/USENIX Internet Measurement Conference (2005)