메뉴 건너뛰기




Volumn , Issue , 2014, Pages 2065-2070

Complexity of equilibrium in diffusion games on social networks

Author keywords

Competitive diffusion game; greedy algorithm; NP hardness; pure Nash equilibrium; social welfare; sub modular function

Indexed keywords

COMPLEX NETWORKS; GAME THEORY;

EID: 84905715401     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2014.6859194     Document Type: Conference Paper
Times cited : (7)

References (21)
  • 7
    • 38449123148 scopus 로고    scopus 로고
    • Competitive influence maximization in social networks
    • Springer
    • S. Bharathi, D. Kempe, and M. Salek, "Competitive influence maximization in social networks", in Internet and Network Economics. Springer, 2007, pp. 306-311.
    • (2007) Internet and Network Economics , pp. 306-311
    • Bharathi, S.1    Kempe, D.2    Salek, M.3
  • 9
    • 84858037291 scopus 로고    scopus 로고
    • How to win friends and influence people, truthfully: Influence maximization mechanisms for social networks
    • ACM
    • Y. Singer, "How to win friends and influence people, truthfully: influence maximization mechanisms for social networks", in Proceedings of the Fifth ACM International Conference on Web Search and Data Mining. ACM, 2012, pp. 733-742.
    • (2012) Proceedings of the Fifth ACM International Conference on Web Search and Data Mining , pp. 733-742
    • Singer, Y.1
  • 11
    • 82155195527 scopus 로고    scopus 로고
    • A comment on purestrategy Nash equilibria in competitive diffusion games
    • R. Takehara, M. Hachimori, and M. Shigeno, "A comment on purestrategy Nash equilibria in competitive diffusion games", Information Processing Letters, vol. 112, no. 3, pp. 59-60, 2012.
    • (2012) Information Processing Letters , vol.112 , Issue.3 , pp. 59-60
    • Takehara, R.1    Hachimori, M.2    Shigeno, M.3
  • 14
    • 77957669941 scopus 로고    scopus 로고
    • Combinatorial model and bounds for target set selection
    • E. Ackerman, O. Ben-Zwi, and G. Wolfovitz, "Combinatorial model and bounds for target set selection", Theoretical Computer Science, vol. 411, no. 44, pp. 4017-4022, 2010.
    • (2010) Theoretical Computer Science , vol.411 , Issue.44 , pp. 4017-4022
    • Ackerman, E.1    Ben-Zwi, O.2    Wolfovitz, G.3
  • 17
    • 84873293949 scopus 로고    scopus 로고
    • Nash equilibria for competitive information diffusion on trees
    • -, "Nash equilibria for competitive information diffusion on trees", Information Processing Letters, vol. 113, no. 7, pp. 217-219, 2013.
    • (2013) Information Processing Letters , vol.113 , Issue.7 , pp. 217-219
    • Small, L.1    Mason, O.2
  • 19
    • 77952254476 scopus 로고    scopus 로고
    • Submodularity of influence in social networks: From local to global
    • E. Mossel and S. Roch, "Submodularity of influence in social networks: From local to global", SIAM Journal on Computing, vol. 39, no. 6, pp. 2176-2188, 2010.
    • (2010) SIAM Journal on Computing , vol.39 , Issue.6 , pp. 2176-2188
    • Mossel, E.1    Roch, S.2
  • 20
    • 38049015001 scopus 로고    scopus 로고
    • Nash equilibria in voronoi games on graphs
    • Springer
    • C. Dürr and N. K. Thang, "Nash equilibria in voronoi games on graphs", in Algorithms-ESA 2007. Springer, 2007, pp. 17-28.
    • (2007) Algorithms-ESA 2007 , pp. 17-28
    • Dürr, C.1    Thang, N.K.2
  • 21
    • 0001627504 scopus 로고
    • Complexity results for multiprocessor scheduling under resource constraints
    • M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling under resource constraints", SIAM Journal on Computing, vol. 4, no. 4, pp. 397-411, 1975.
    • (1975) SIAM Journal on Computing , vol.4 , Issue.4 , pp. 397-411
    • Garey, M.R.1    Johnson, D.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.