Determining the top-k nodes in social networks using the Shapley value

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 3, Issue , 2008, Pages 1473-1476

  Rama Suri, N ^a   Narahari, Y ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Approximation algorithms; Co authorship networks; Shapley value; Social networks

Indexed keywords

APPROXIMATION ALGORITHMS; AUTONOMOUS AGENTS; GAME THEORY; MULTI AGENT SYSTEMS; SOCIAL NETWORKING (ONLINE);

APPROXIMATE SOLUTION; CO-AUTHORSHIP NETWORKS; COAUTHORSHIP; DATA SET; OBJECTIVE FUNCTIONS; POSITIVE INTEGERS; SHAPLEY VALUE; VIRAL MARKETING;

PROBLEM SOLVING;

EID: 84899995022     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. P. Domingos and M. Richardson. Mining the network value of customers. In Proceedings of ACM SIGKDD, 2001.
2. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Proceedings of ACM SIGKDD, 2003.
3. D. Kempe, J. Kleinberg, and E. Tardos. Influential nodes in a diffusion model for social networks. In Proceedings of ICALP, 2005.
4. R. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, 1997.
5. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
6. M. Newman. The structure of scientific collaboration networks. In Proc. Natl. Acad. Sci., 2001.
7. L. Shapley. A Value for N-Person Games. In Kuhn and Tucker, editors, Contributions to the Theory of Games, 1953.
8. S. Wasserman. Social Network Analysis. Cambridge University Press, 1994.