Self-organizing flows in social networks

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

Volumn 8179 LNCS, Issue , 2013, Pages 116-128

  Hegde, Nidhi ^a   Massoulié, Laurent ^b   Viennot, Laurent ^c  

^a Technicolor ^*  (France)

^b MICROSOFT RESEARCH   (United States)

^c INRIA   (France)

Author keywords

Budget of attention; Network formation; Price of anarchy; Self organisation; Social filtering

Indexed keywords

BUDGET OF ATTENTION; NETWORK FORMATION; PRICE OF ANARCHY; SELF ORGANISATION; SOCIAL FILTERING;

BUDGET CONTROL; COMPLEX NETWORKS; DYNAMICS; INFORMATION DISSEMINATION; SOCIAL NETWORKING (ONLINE);

INFORMATION FILTERING;

EID: 84892982625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-03578-9_10     Document Type: Conference Paper

References (23)

1. Abraham, I., Malkhi, D., Dobzinski, O.: LAND: stretch (1 + ∈) locality-aware networks for DHTs. In: Munro, J.I. (ed.) SODA, pp. 550-559. SIAM (2004)
2. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, pp. 295-304. IEEE Computer Society, Washington, DC (2004)
3. Bala, V., Goyal, S.: A noncooperative model of network formation. Econometrica 68(5), 1181-1229 (2000)
4. Bei, X., Chen, W., Teng, S.-H., Zhang, J., Zhu, J.: Bounded budget betweenness centrality game for strategic network formations. Theor. Comput. Sci. 412(52), 7147-7168 (2011)
5. Cha, M., Haddadi, H., Benevenuto, F., Gummadi, P.K.: Measuring user influence in twitter: The million follower fallacy. In: Cohen, W.W., Gosling, S. (eds.) ICWSM. The AAAI Press (2010)
6. Clarkson, K.: Nearest neighbor queries in metric spaces. Discrete & Computational Geometry 22(1), 63-93 (1999)
7. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. ACM PODC, pp. 347-351 (2003)
8. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: Babai, L. (ed.) STOC, pp. 604-612. ACM (2004)
9. Fraigniaud, P., Lebhar, E., Viennot, L.: The inframetric model for the internet. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), Phoenix, pp. 1085-1093 (2008)
10. Gai, A.-T., Lebedev, D., Mathieu, F., de Montgolfier, F., Reynier, J., Viennot, L.: Acyclic Preference Systems in P2P Networks. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 825-834. Springer, Heidelberg (2007)
11. Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. In: Mitchell, J.S.B., Rote, G. (eds.) Symposium on Computational Geometry, pp. 150-158. ACM (2005)
12. Hegde, N., Massoulié, L., Viennot, L.: Self-organising flows in social networks. arXiv e-print, arXiv:1212.0952 (2012)
13. Jackson, M.: Social and Economic Networks. Princeton University Press (2010)
14. Jiang, B., Hegde, N., Massoulié, L., Towsley, D.: How to optimally allocate your budget of attention in social networks. In: Proc. IEEE Infocom (2013)
15. Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Reif, J.H. (ed.) STOC, pp. 741-750. ACM (2002)
16. Laoutaris, N., Poplawski, L.J., 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 Twenty-seventh ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 165-174. ACM, New York (2008)
17. Massoulié, L., Twigg, A.: Rate-optimal schemes for peer-to-peer live streaming. In: Journal of Performance Analysis (2008)
18. Monderer, D., Shapley, L.: Potential games. In: Games and Economic Behavior, pp. 124-143 (1996)
19. Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge Univ. Press (2007)
20. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst. 32(3), 241-280 (1999)
21. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65-67 (1973)
22. Roughgarden, T.: Potential functions and the inefficiency of equilibria. In: Proceedings of the International Congress of Mathematicians (ICM), vol. 3, pp. 1071-1094 (2006)
23. Simon, H.A.: Designing organizations for an information rich world. In: Greenberger, M. (ed.) Computers, Communications, and the Public Interest, pp. 37-72. The Johns Hopkins Press, Baltimore (1971)