Referral Web: combining social networks and collaborative filtering
Communications of the ACM
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
A Social Mechanism of Reputation Management in Electronic Communities
CIA '00 Proceedings of the 4th International Workshop on Cooperative Information Agents IV, The Future of Information Agents in Cyberspace
Mining knowledge-sharing sites for viral marketing
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
SWIM: fostering social network based information search
CHI '04 Extended Abstracts on Human Factors in Computing Systems
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The dynamics of viral marketing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Combating web spam with trustrank
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Influential nodes in a diffusion model for social networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Truthful and Quality Conscious Query Incentive Networks
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Threshold behavior of incentives in social networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Finding red balloons with split contracts: robustness to individuals' selfishness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Task routing for prediction tasks
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Sybil-proof mechanisms in query incentive networks
Proceedings of the fourteenth ACM conference on Electronic commerce
Cascading behavior in social and economic networks
Proceedings of the fourteenth ACM conference on Electronic commerce
Algorithms, networks, and social phenomena
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Motivated by the role of incentives in large-scale information systems, Kleinberg and Raghavan (FOCS 2005) studied strategic games in decentralized information networks. Given a branching process that specifies the network, the rarity of answers to a specific question, and a desired probability of success, how much reward does the root node need to offer so that it receives an answer with this probability, when all of the nodes are playing strategically? For a specific family of branching processes and a constant failure probability, they showed that the reward function exhibited a threshold behavior that depends on the branching parameter b. In this paper we study two factors that can contribute to this transition behavior, namely, the branching process itself and the failure probability. On one hand we show that the threshold behavior is robust with respect to the branching process: for all branching processes and any constant failure probability, if b 2 then the required reward is linear in the expected depth of the search tree, and if b all branching processes require rewards exponential in the depth of the search tree.