Referral Web: combining social networks and collaborative filtering
Communications of the ACM
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Agents to assist in finding help
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Query strategies for priced information (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved classification via connectivity information
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Efficient information gathering on the Internet
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
SWIM: fostering social network based information search
CHI '04 Extended Abstracts on Human Factors in Computing Systems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Incentive mechanisms for peer-to-peer systems
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
We formulate a model for query incentive networks, motivated by users seeking information or services that pose queries, together with incentives for answering them. This type of information-seeking process can be formulated as a game among the nodes in the network, and this game has a natural Nash equilibrium. How much incentive is needed in order to achieve a reasonable probability of obtaining an answer to a query? We study the size of query incentives as a function both of the rarity of the answer and the structure of the underlying network. This leads to natural questions related to strategic behavior in branching processes. Whereas the classically studied criticality of branching processes is centered around the region where the branching parameter is 1, we show in contrast that strategic interaction in incentive propagation exhibits critical behavior when the branching parameter is 2. This lecture is based on the paper [14] with Jon Kleinberg of Cornell University.