Show simple item record

dc.contributor.authorBorgs, Christian
dc.contributor.authorChayes, Jennifer
dc.contributor.authorKarrer, Brian
dc.contributor.authorMeeder, Brendan
dc.contributor.authorRavi, R.
dc.contributor.authorReagans, Ray Eugene
dc.contributor.authorSayedi, Amin
dc.date.accessioned2012-06-20T15:41:53Z
dc.date.available2012-06-20T15:41:53Z
dc.date.issued2010-12
dc.date.submitted2010-07
dc.identifier.isbn9783642180095
dc.identifier.isbn3642180094
dc.identifier.urihttp://hdl.handle.net/1721.1/71180
dc.description.abstractWe 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.en_US
dc.language.isoen_US
dc.publisherSpringer-Verlagen_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceProf. Reagans via Alex Caracuzzoen_US
dc.titleGame-Theoretic Models of Information Overload in Social Networksen_US
dc.typeArticleen_US
dc.identifier.citationBorgs, Christian et al. "Game-Theoretic Models of Information Overload in Social Networks." in Algorithms and Models for the Web-Graph (Lecture Notes in Computer Science), 2010, Volume 6516/2010, 146-161.en_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.approverReagans, Ray Eugene
dc.contributor.mitauthorReagans, Ray Eugene
dc.relation.journal7th International Workshop on Algorithms and Models for the Web Graph, WAW 2010, December 13, 2010 - December 14, 2010.en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.identifier.orcidhttps://orcid.org/0000-0001-8706-3124
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record