Abstract
Query incentive networks capture the role of incentives in extracting information from decentralized information networks such as a social network. Several game theoretic models of query incentive networks have been proposed in the literature to study and characterize the dependence, of the monetary reward required to extract the answer for a query, on various factors such as the structure of the network, the level of difficulty of the query, and the required success probability. None of the existing models, however, captures the practical and important factor of quality of answers. In this paper, we develop a complete mechanism design based framework to incorporate the quality of answers, in the monetization of query incentive networks. First, we extend the model of Kleinberg and Raghavan [2] to allow the nodes to modulate the incentive on the basis of the quality of the answer they receive. For this quality conscious model, we show the existence of a unique Nash equilibrium and study the impact of quality of answers on the growth rate of the initial reward, with respect to the branching factor of the network. Next, we present two mechanisms, the direct comparison mechanism and the peer prediction mechanism, for truthful elicitation of quality from the agents. These mechanisms are based on scoring rules and cover different scenarios which may arise in query incentive networks. We show that the proposed quality elicitation mechanisms are incentive compatible and ex-ante budget balanced. We also derive conditions under which ex-post budget balance can be achieved by these mechanisms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proc. International Conference on the World Wide Web (WWW), pp. 403–412 (2004)
Kleinberg, J., Raghavan, P.: Query incentive networks. In: Proc. Symposium on Foundations of Computer Science (FOCS), pp. 132–141 (2005)
Arcaute, E., Kirsch, A., Kumar, R., Liben-Nowell, D., Vassilvitskii, S.: On Threshold Behavior in Query Incentive Networks. In: ACM Conference on Electronic Commerce (EC), pp. 66–74 (2007)
Selten, R.: Axiomatic Characterization of the Quadratic Scoring Rule. Discussion Paper Serie B 390, University of Bonn, Germany (1996)
Jurca, R., Faltings, B.: Confess: Eliciting honest feedback without independent verification authorities. In: Proceedings of Sixth International Workshop on Agent Mediated Electronic Commerce (AMEC VI), pp. 59–72 (2004)
Xia, L., Conitzer, V.: Generalized scoring rules and the frequency of coalitional manipulability. In: Proceedings of ACM Conference on Electronic Commerce, pp. 109–118 (2008)
Lambert, N.S., Pennock, D.M., Shoham, Y.: Eliciting properties of probability distributions. In: Proceedings of ACM Conference on Electronic Commerce, pp. 129–138 (2008)
Dikshit, D.: Quality Conscious and Truthful Query Incentive Networks. M.E. project report. Department of Computer Science and Automation, Indian Institute of Science, Bangalore (July 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dikshit, D., Yadati, N. (2009). Truthful and Quality Conscious Query Incentive Networks. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-10841-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10840-2
Online ISBN: 978-3-642-10841-9
eBook Packages: Computer ScienceComputer Science (R0)