{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:03:39Z","timestamp":1778270619853,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030859466","type":"print"},{"value":"9783030859473","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_6","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Incentive Compatible Mechanism for Influential Agent Selection"],"prefix":"10.1007","author":[{"given":"Xiuzhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dengji","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, F., Procaccia, A., Tennenholtz, M.: Sum of us: strategyproof selection from the selectors. In: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 101\u2013110 (2011)","DOI":"10.1145\/2000378.2000390"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lev, O., Mattei, N., Rosenschein, J.S., Walsh, T.: Strategyproof peer selection: mechanisms, analyses, and experiments. In: AAAI, pp. 397\u2013403 (2016)","DOI":"10.1609\/aaai.v30i1.10038"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Dean, O., Tennenholtz, M.: Incentive-compatible diffusion. In: Proceedings of the 2018 World Wide Web Conference, pp. 1379\u20131388 (2018)","DOI":"10.1145\/3178876.3186043"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Dean, O., Tennenholtz, M.: Incentive-compatible selection mechanisms for forests. In: EC 2020: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, 13\u201317 July 2020, pp. 111\u2013131. ACM (2020)","DOI":"10.1145\/3391403.3399456"},{"key":"6_CR5","unstructured":"Caragiannis, I., Christodoulou, G., Protopapas, N.: Impartial selection with prior information. arXiv preprint arXiv:2102.09002 (2021)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Emek, Y., Karidi, R., Tennenholtz, M., Zohar, A.: Mechanisms for multi-level marketing. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 209\u2013218 (2011)","DOI":"10.1145\/1993574.1993606"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/140995775","volume":"44","author":"F Fischer","year":"2015","unstructured":"Fischer, F., Klimm, M.: Optimal impartial selection. SIAM J. Comput. 44(5), 1263\u20131285 (2015)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.2307\/2297639","volume":"53","author":"JR Green","year":"1986","unstructured":"Green, J.R., Laffont, J.J.: Partially verifiable information and mechanism design. Rev. Econ. Stud. 53(3), 447\u2013456 (1986)","journal-title":"Rev. Econ. Stud."},{"key":"6_CR9","unstructured":"Huang, K., et al.: Efficient approximation algorithms for adaptive influence maximization. arXiv preprint arXiv:2004.06469 (2020)"},{"key":"6_CR10","unstructured":"Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: AAAI, vol. 7, pp. 1371\u20131376 (2007)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1017\/CBO9780511800481.026","volume":"24","author":"J Kleinberg","year":"2007","unstructured":"Kleinberg, J.: Cascading behavior in networks: algorithmic and economic issues. Algorithmic Game Theory 24, 613\u2013632 (2007)","journal-title":"Algorithmic Game Theory"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2018.07.003","volume":"465","author":"YY Ko","year":"2018","unstructured":"Ko, Y.Y., Cho, K.J., Kim, S.W.: Efficient and effective influence maximization in social networks: a hybrid-approach. Inf. Sci. 465, 144\u2013161 (2018)","journal-title":"Inf. Sci."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-21786-9_40","volume-title":"Pattern Recognition and Machine Intelligence","author":"S Kundu","year":"2011","unstructured":"Kundu, S., Murthy, C.A., Pal, S.K.: A new centrality measure for influence maximization in social networks. In: Kuznetsov, S.O., Mandal, D.P., Kundu, M.K., Pal, S.K. (eds.) PReMI 2011. LNCS, vol. 6744, pp. 242\u2013247. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21786-9_40"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"28436","DOI":"10.1109\/ACCESS.2019.2894954","volume":"7","author":"A Mohammadinejad","year":"2019","unstructured":"Mohammadinejad, A., Farahbakhsh, R., Crespi, N.: Consensus opinion model in online social networks based on influential users. IEEE Access 7, 28436\u201328451 (2019)","journal-title":"IEEE Access"},{"issue":"7563","key":"6_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 524(7563), 65\u201368 (2015)","journal-title":"Nature"},{"key":"6_CR16","unstructured":"Narahari, Y., Mohite, M.: Incentive compatible influence maximization in social networks. In: International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2011)"},{"key":"6_CR17","unstructured":"Narayanam, R., Narahari, Y.: Determining the top-k nodes in social networks using the shapley value. In: AAMAS (3), pp. 1509\u20131512 (2008)"},{"key":"6_CR18","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"issue":"3","key":"6_CR19","first-page":"317","volume":"130","author":"SK Pal","year":"2014","unstructured":"Pal, S.K., Kundu, S., Murthy, C.: Centrality measures, upper bound, and influence maximization in large scale directed social networks. Fund. Inform. 130(3), 317\u2013342 (2014)","journal-title":"Fund. Inform."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Shen, W., Feng, Y., Lopes, C.V.: Multi-winner contests for strategic diffusion in social networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 6154\u20136162 (2019)","DOI":"10.1609\/aaai.v33i01.33016154"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"27823","DOI":"10.1038\/srep27823","volume":"6","author":"JX Zhang","year":"2016","unstructured":"Zhang, J.X., Chen, D.B., Dong, Q., Zhao, Z.D.: Identifying a set of influential spreaders in complex networks. Sci. Rep. 6, 27823 (2016)","journal-title":"Sci. Rep."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, X., Zhao, D.: Sybil-proof answer querying mechanism. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 422\u2013428. Ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/59"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:37:59Z","timestamp":1673235479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}