{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:11:10Z","timestamp":1751602270019,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":25,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"European Research Council (ERC)","award":["740435"],"award-info":[{"award-number":["740435"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186043","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1379-1388","source":"Crossref","is-referenced-by-count":7,"title":["Incentive-Compatible Diffusion"],"prefix":"10.1145","author":[{"given":"Yakov","family":"Babichenko","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Dean","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186043-1","unstructured":"2017. Wikipedia. (October 2017 2017). http:\/\/en.wikipedia.org\/wiki\/PageRank# Simplified_algorithm"},{"key":"key-10.1145\/3178876.3186043-2","doi-asserted-by":"crossref","unstructured":"Noga Alon, Felix Fischer, Ariel Procaccia, and Moshe Tennenholtz. 2011. Sum of Us: Strategyproof Selection from the Selectors. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XIII). ACM, New York, NY, USA, 101--110. https:\/\/doi.org\/10.1145\/2000378.2000390","DOI":"10.1145\/2000378.2000390"},{"key":"key-10.1145\/3178876.3186043-3","doi-asserted-by":"crossref","unstructured":"Reid Andersen, Christian Borgs, Jennifer Chayes, Uriel Feige, Abraham Flaxman, Adam Kalai, Vahab Mirrokni, and Moshe Tennenholtz. 2008. Trust-based Recommendation Systems: An Axiomatic Approach. In Proceedings of the 17th International Conference on World Wide Web (WWW '08). ACM, New York, NY, USA, 199--208. https:\/\/doi.org\/10.1145\/1367497.1367525","DOI":"10.1145\/1367497.1367525"},{"key":"key-10.1145\/3178876.3186043-4","doi-asserted-by":"crossref","unstructured":"Sofía Aparicio, Javier Villazón-Terrazas, and Gonzalo Álvarez. 2015. A Model for Scale-Free Networks: Application to Twitter. Entropy 17 (2015), 5848--5867.","DOI":"10.3390\/e17085848"},{"key":"key-10.1145\/3178876.3186043-5","doi-asserted-by":"crossref","unstructured":"Haris Aziz, Omer Lev, Nicholas Mattei, Jeffrey S. Rosenschein, and Toby Walsh. 2016. Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI'16). AAAI Press, 390--396. http:\/\/dl.acm.org\/citation.cfm?id=3015812.3015872","DOI":"10.1609\/aaai.v30i1.10038"},{"key":"key-10.1145\/3178876.3186043-6","doi-asserted-by":"crossref","unstructured":"Albert-László Barabási and Réka Albert. 1999. Emergence of Scaling in Random Networks. Science 286, 5439 (1999), 509--512. https:\/\/doi.org\/10.1126\/science.286. 5439.509 arXiv:http:\/\/science.sciencemag.org\/content\/286\/5439\/509.full.pdf","DOI":"10.1126\/science.286.5439.509"},{"key":"key-10.1145\/3178876.3186043-7","unstructured":"Stefan Bornholdt and Heinz Georg Schuster (Eds.). 2003. Handbook of Graphs and Networks: From the Genome to the Internet. John Wiley & Sons, Inc., New York, NY, USA."},{"key":"key-10.1145\/3178876.3186043-8","unstructured":"Sergey Brin and Lawrence Page. 1998. The Anatomy of a Large-scale Hypertextual Web Search Engine. Comput. Netw. ISDN Syst. 30, 1--7 (April 1998), 107--117. https:\/\/doi.org\/10.1016\/S0169--7552(98)00110-X"},{"key":"key-10.1145\/3178876.3186043-9","doi-asserted-by":"crossref","unstructured":"Guido Caldarelli. 2007. Scale-Free Networks. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199211517.001.0001"},{"key":"key-10.1145\/3178876.3186043-10","doi-asserted-by":"crossref","unstructured":"S. N. Dorogovtsev and J. F. F. Mendes. 2002. Evolution of networks. Advances in Physics 51 (June 2002), 1079--1187. https:\/\/doi.org\/10.1080\/00018730110112519 arXiv:cond-mat\/0106144","DOI":"10.1080\/00018730110112519"},{"key":"key-10.1145\/3178876.3186043-11","doi-asserted-by":"crossref","unstructured":"S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin. 2000. Structure of Growing Networks with Preferential Linking. Physical Review Letters 85 (Nov. 2000), 4633-- 4636. https:\/\/doi.org\/10.1103\/PhysRevLett.85.4633 arXiv:cond-mat\/0004434","DOI":"10.1103\/PhysRevLett.85.4633"},{"key":"key-10.1145\/3178876.3186043-12","doi-asserted-by":"crossref","unstructured":"David Easley and Jon Kleinberg. 2010. Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press.","DOI":"10.1017\/CBO9780511761942"},{"key":"key-10.1145\/3178876.3186043-13","doi-asserted-by":"crossref","unstructured":"Scott L. Feld. 1991. Why Your Friends Have More Friends Than You Do. Amer. J. Sociology 96, 6 (1991), 1464--1477. http:\/\/www.jstor.org\/stable\/2781907","DOI":"10.1086\/229693"},{"key":"key-10.1145\/3178876.3186043-14","doi-asserted-by":"crossref","unstructured":"Felix Fischer and Max Klimm. 2014. Optimal Impartial Selection. In Proceedings of the Fifteenth ACM Conference on Economics and Computation (EC '14). ACM, New York, NY, USA, 803--820. https:\/\/doi.org\/10.1145\/2600057.2602836","DOI":"10.1145\/2600057.2602836"},{"key":"key-10.1145\/3178876.3186043-15","unstructured":"J. Goldenberg, B. Libai, and Muller. 2001. Using complex systems analysis to advance marketing theory development. Academy of Marketing Science Review (2001)."},{"key":"key-10.1145\/3178876.3186043-16","doi-asserted-by":"crossref","unstructured":"Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth. Marketing Letters 12, 3 (2001), 211--223. https:\/\/doi.org\/10.1023\/A:1011122126881","DOI":"10.1023\/A:1011122126881"},{"key":"key-10.1145\/3178876.3186043-17","unstructured":"S. Gualdi, M. Medo, and Y.-C. Zhang. 2011. Influence, originality and similarity in directed acyclic graphs. EPL (Europhysics Letters) 96, 1 (2011), 18004. http: \/\/stacks.iop.org\/0295--5075\/96\/i=1\/a=18004"},{"key":"key-10.1145\/3178876.3186043-18","unstructured":"Ron Holzman and Hervé Moulin. 2013. Impartial Nominations for a Prize. Econometrica 81, issue 1 (2013), 173-196."},{"key":"key-10.1145\/3178876.3186043-19","doi-asserted-by":"crossref","unstructured":"David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the Spread of Influence Through a Social Network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '03). ACM, New York, NY, USA, 137--146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"key-10.1145\/3178876.3186043-20","unstructured":"David Kurokawa, Omer Lev, Jamie Morgenstern, and Ariel D. Procaccia. 2015. Impartial Peer Review. In Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI'15). AAAI Press, 582--588. http:\/\/dl.acm.org\/citation. cfm?id=2832249.2832330"},{"key":"key-10.1145\/3178876.3186043-21","doi-asserted-by":"crossref","unstructured":"Silvio Lattanzi and Yaron Singer. 2015. The Power of Random Neighbors in Social Networks. In Proceedings of the Eighth ACM International Conference on Web Search and Data Mining (WSDM '15). ACM, New York, NY, USA, 77--86. https:\/\/doi.org\/10.1145\/2684822.2685293","DOI":"10.1145\/2684822.2685293"},{"key":"key-10.1145\/3178876.3186043-22","doi-asserted-by":"crossref","unstructured":"Beiming Sun and Vincent TY Ng. 2012. Identifying Influential Users by Their Postings in Social Networks. In Proceedings of the 3rd International Workshop on Modeling Social Media (MSM '12). ACM, New York, NY, USA, 1--8. https: \/\/doi.org\/10.1145\/2310057.2310059","DOI":"10.1145\/2310057.2310059"},{"key":"key-10.1145\/3178876.3186043-23","doi-asserted-by":"crossref","unstructured":"Shohei Tamura. 2016. Characterizing minimal impartial rules for awarding prizes. Games and Economic Behavior 95, Supplement C (2016), 41 -- 46. https: \/\/doi.org\/10.1016\/j.geb.2015.12.005","DOI":"10.1016\/j.geb.2015.12.005"},{"key":"key-10.1145\/3178876.3186043-24","doi-asserted-by":"crossref","unstructured":"Michael Trusov, Anand V. Bodapati, and Randolph E. Bucklin. 2010. Determining Influential Users in Internet Social Networks. Journal of Marketing Research 47, 4 (2010), 643--658. https:\/\/doi.org\/10.1509\/jmkr.47.4.643 arXiv:https:\/\/doi.org\/10.1509\/jmkr.47.4.643","DOI":"10.1509\/jmkr.47.4.643"},{"key":"key-10.1145\/3178876.3186043-25","unstructured":"Yufeng Wang, Athanasios V. Vasilakos, Qun Jin, and Jianhua Ma. 2015. PPRank: Economically Selecting Initial Users for Influence Maximization in Social Networks. IEEE Systems Journal PP (Jan. 2015), 1--12. Issue 99. https:\/\/doi.org\/10. 1109\/JSYST.2014.2369526"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186043","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186043&ftid=1957424&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:27:29Z","timestamp":1751563649000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186043"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186043","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}