Game-Theoretic Models of Information Overload in Social Networks

被引:0
|
作者
Borgs, Christian [1 ]
Chayes, Jennifer [1 ]
Karrer, Brian [1 ]
Meeder, Brendan [1 ]
Ravi, R. [1 ]
Reagans, Ray [1 ]
Sayedi, Amin [1 ]
机构
[1] Microsoft Res New England, Cambridge, MA USA
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition between celebrities producing updates in such networks where users non-strategically choose a subset of celebrities to follow based on the utility derived from high quality updates as well as disutility derived from having to wade through too many updates. Our two variants model the two behaviors of users dropping some potential connections (followership model) or leaving the network altogether (engagement model). We show that under a simple formulation of celebrity rate competition, there is no pure strategy Nash equilibrium under the first model. We then identify special cases in both models when pure rate equilibria exist for the celebrities: For the followership model, we show existence of a pure rate equilibrium when there is a global ranking of the celebrities in terms of the quality of their updates to users. This result also generalizes to the case when there is a partial order consistent with all the linear orders of the celebrities based on their qualities to the users. Furthermore, these equilibria can be computed in polynomial time. For the engagement model, pure rate equilibria exist when all users are interested in the same number of celebrities, or when they are interested in at most two. Finally, we also give a finite though inefficient procedure to determine if pure equilibria exist in the general case of the followership model.
引用
收藏
页码:146 / 161
页数:16
相关论文
共 50 条
  • [1] On game-theoretic models of networks
    Bodlaender, HL
    Dinneen, MJ
    Khoussainov, B
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 550 - 561
  • [2] Game-theoretic Models of Informational Confrontation in Social Networks
    Gubanov, D. A.
    Kalashnikov, A. O.
    Novikov, D. A.
    [J]. AUTOMATION AND REMOTE CONTROL, 2011, 72 (09) : 2001 - 2008
  • [3] Game-theoretic models of informational confrontation in social networks
    D. A. Gubanov
    A. O. Kalashnikov
    D. A. Novikov
    [J]. Automation and Remote Control, 2011, 72 : 2001 - 2008
  • [4] GAME-THEORETIC MODELS AND THE ROLE OF INFORMATION IN BARGAINING
    ROTH, AE
    MALOUF, MWK
    [J]. PSYCHOLOGICAL REVIEW, 1979, 86 (06) : 574 - 594
  • [5] A Game-Theoretic Approach to Coding for Information Networks
    Price, Jennifer
    Javidi, Tara
    [J]. 2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1397 - +
  • [6] Wireless social community, networks:: A game-theoretic analysis
    Manshaei, Mohammad Hossein
    Freudiger, Julien
    Felegyhazi, Mark
    Marbach, Peter
    Hubaux, Jean-Pierre
    [J]. 2008 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS, 2008, : 22 - +
  • [7] Sustainability of Information Security Investment in Online Social Networks: An Evolutionary Game-Theoretic Approach
    Zhu, Guang
    Liu, Hu
    Feng, Mining
    [J]. MATHEMATICS, 2018, 6 (10)
  • [8] Community Detection in Dynamic Social Networks: A Game-Theoretic Approach
    Alvari, Hamidreza
    Hajibagheri, Alireza
    Sukthankar, Gita
    [J]. 2014 PROCEEDINGS OF THE IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2014), 2014, : 101 - 107
  • [9] Competitive diffusion in signed social networks: A game-theoretic perspective
    Lin, Xue
    Jiao, Qiang
    Wang, Long
    [J]. AUTOMATICA, 2020, 112
  • [10] A game-theoretic framework to identify overlapping communities in social networks
    Wei Chen
    Zhenming Liu
    Xiaorui Sun
    Yajun Wang
    [J]. Data Mining and Knowledge Discovery, 2010, 21 : 224 - 240