Talks & Seminars
Query Incentive Networks by Dr. Prabhakar Raghavan
Dr. Prabhakar Raghavan, Head of Research at Yahoo!
Date & Time: January 26, 2006 15:30
Venue: FC Kohli Auditorium, KReSIT
We formulate a model for {\em 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 given 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. Joint work with Jon Kleinberg of Cornell University.
Speaker Profile:
Prabhakar Raghavan is Head of Research at Yahoo! and Consulting Professor of Computer Science at Stanford University. His research interests include semi-structured retrieval, text mining and randomized algorithms. He is Editor-in-chief of the Journal of the ACM and a Fellow of the ACM and of the IEEE. Raghavan holds a PhD from the University of California at Berkeley and an undergraduate degree in electrical engineering from IIT Madras.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback