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
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
Incentive mechanisms for peer-to-peer systems
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
The changing face of web search: algorithms, auctions and advertising
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Social networks, incentives, and search
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
On threshold behavior in query incentive networks
Proceedings of the 8th ACM conference on Electronic commerce
Challenges in mining social network data: processes, privacy, and paradoxes
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
iLink: search and routing in social networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Making p2p accountable without losing privacy
Proceedings of the 2007 ACM workshop on Privacy in electronic society
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The convergence of social and technological networks
Communications of the ACM - Remembering Jim Gray
Truthful and Quality Conscious Query Incentive Networks
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Influence in a large society: interplay between information dynamics and network structure
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Information sharing communities
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Public advertisement broker markets
WINE'07 Proceedings of the 3rd international conference 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
Game theoretic models for social network analysis
Proceedings of the 20th international conference companion on World wide web
Web Wisdom: An essay on how Web 2.0 and Semantic Web can foster a global knowledge society
Computers in Human Behavior
Mechanisms for multi-level marketing
Proceedings of the 12th ACM conference on Electronic commerce
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Algorithmic challenges in web search engines
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Proceedings of the fifth ACM international conference on Web search and data mining
Algorithmic challenges in web search engines
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Finding red balloons with split contracts: robustness to individuals' selfishness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the 13th ACM Conference on Electronic Commerce
Simpler sybil-proof mechanisms for multi-level marketing
Proceedings of the 13th ACM Conference on Electronic Commerce
Task routing for prediction tasks
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Mechanism design for time critical and cost critical task execution via crowdsourcing
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
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
Fair and resilient incentive tree mechanisms
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Eliciting high quality feedback from crowdsourced tree networks using continuous scoring rules
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Steering user behavior with badges
Proceedings of the 22nd international conference on World Wide Web
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 |
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in understanding networks of interacting agents as economic systems. Here we formulate a model for query incentive networks, motivated by such systems: users seeking information or services can pose queries, together with incentives for answering them, that are propagated along paths in a network. 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. In such systems, it is a fundamental question to understand how much incentive is needed in order for a node to achieve a reasonable probability of obtaining an answer to a query from the network. 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.