Skip to Main content Skip to Navigation
Conference papers

How to Optimally Allocate Your Budget of Attention in Social Networks

Abstract : We consider the performance of information propagation through social networks in a scenario where each user has a budget of attention, that is, a constraint on the frequency with which he pulls content from neighbors. In this context we ask the question "when users make selfish decisions on how to allocate their limited access frequency among neighbors, does information propagate efficiently?" For the metric of average propagation delay, we provide characterizations of the optimal social cost and the social cost under selfish user optimizations for various topologies of interest. Three situations may arise: well-connected topologies where delay is small even under selfish optimization; tree-like topologies where selfish optimization performs poorly while optimal social cost is low; and "stretched" topologies where even optimal social cost is high. We propose a mechanism for incentivizing users to modify their selfish behaviour, and observe its efficiency in the family of tree-like topologies mentioned above.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Laurent Massoulié Connect in order to contact the contributor
Submitted on : Friday, June 28, 2013 - 3:49:02 PM
Last modification on : Thursday, January 20, 2022 - 5:30:41 PM
Long-term archiving on: : Sunday, September 29, 2013 - 4:40:41 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00839599, version 1



Bo Jiang, Nidhi Hegde, Laurent Massoulié, Don Towsley. How to Optimally Allocate Your Budget of Attention in Social Networks. IEEE INFOCOM 2013 - IEEE Conference on Computer Communications, Apr 2013, Torino, Italy. ⟨hal-00839599⟩



Les métriques sont temporairement indisponibles