Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/INFCOM.2013.6567042 | INFOCOM |
Keywords | Field | DocType |
optimal social cost,selfish user optimizations,trees (mathematics),access frequency,social networks,tree-like topologies,information propagation,average propagation delay,information dissemination,social networking (online),stretched topologies,topology,resource management,network topology,stability analysis | Social cost,Ask price,Social network,Propagation delay,Computer science,Computer network,Network topology,Information propagation,Information Dissemination,Distributed computing,Access frequency | Conference |
ISSN | ISBN | Citations |
0743-166X | 978-1-4673-5944-3 | 10 |
PageRank | References | Authors |
0.57 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bo Jiang | 1 | 87 | 9.66 |
| Nidhi Hegde | 2 | 234 | 20.41 |
| Laurent Massoulié | 3 | 3512 | 244.42 |
| Don Towsley | 4 | 18693 | 1951.05 |