{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:05Z","timestamp":1742912405582,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031255489"},{"type":"electronic","value":"9783031255496"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25549-6_4","type":"book-chapter","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T09:07:44Z","timestamp":1679389664000},"page":"45-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximal Information Propagation with\u00a0Limited Resources"],"prefix":"10.1007","author":[{"given":"Xu","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuzhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dengji","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dobzinski, S., Oren, S., Zohar, A.: On bitcoin and red balloons. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, pp. 56\u201373. ACM (2012)","DOI":"10.1145\/2229012.2229022"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Huzhang, G., Tao, B., Wu, J.: Cake cutting: Envy and truth. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 3625\u20133631. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/507"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-030-94676-0_27","volume-title":"Web and Internet Economics","author":"J Chen","year":"2022","unstructured":"Chen, J., Li, B.: Maximal information propagation via\u00a0lotteries. In: Feldman, M., Fu, H., Talgam-Cohen, I. (eds.) WINE 2021. LNCS, vol. 13112, pp. 486\u2013503. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94676-0_27"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yu, D., Zhang, L.: Sybil-proof mechanisms in query incentive networks. In: Proceedings of the 14th ACM Conference on Electronic Commerce, EC 2013, pp. 197\u2013214. ACM (2013)","DOI":"10.1145\/2482540.2482588"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games Econ. Behav. 77(1), 284\u2013297 (2013)","journal-title":"Games Econ. Behav."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Dey, S.: Securing majority-attack in blockchain using machine learning and algorithmic game theory: a proof of work. In: 2018 10th Computer Science and Electronic Engineering Conference, CEEC 2018, pp. 7\u201310. IEEE (2018)","DOI":"10.1109\/CEEC.2018.8674185"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Emek, Y., Karidi, R., Tennenholtz, M., Zohar, A.: Mechanisms for multi-level marketing. In: Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), pp. 209\u2013218. ACM (2011)","DOI":"10.1145\/1993574.1993606"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0167-9236(99)00062-7","volume":"27","author":"MY Kiang","year":"2000","unstructured":"Kiang, M.Y., Raghu, T.S., Shang, K.H.: Marketing on the internet - who can benefit from an online marketing approach? Decis. Support Syst. 27, 383\u2013393 (2000)","journal-title":"Decis. Support Syst."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Raghavan, P.: Query incentive networks. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23\u201325 October 2005, pp. 132\u2013141. IEEE Computer Society (2005)","DOI":"10.1109\/SFCS.2005.63"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"103631","DOI":"10.1016\/j.artint.2021.103631","volume":"303","author":"B Li","year":"2022","unstructured":"Li, B., Hao, D., Gao, H., Zhao, D.: Diffusion auction design. Artif. Intell. 303, 103631 (2022)","journal-title":"Artif. Intell."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Li, B., Hao, D., Zhao, D., Zhou, T.: Mechanism design in social networks. In: Proceedings of the 31 AAAI Conference on Artificial Intelligence, 4\u20139 February 2017, San Francisco, California, USA, pp. 586\u2013592. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10605"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"47615","DOI":"10.1109\/ACCESS.2019.2909924","volume":"7","author":"Z Liu","year":"2019","unstructured":"Liu, Z., et al.: A survey on blockchain: a game theoretical perspective. IEEE Access 7, 47615\u201347643 (2019)","journal-title":"IEEE Access"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-16170-4_25","volume-title":"Algorithmic Game Theory","author":"E Mossel","year":"2010","unstructured":"Mossel, E., Tamuz, O.: Truthful fair division. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 288\u2013299. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16170-4_25"},{"key":"4_CR14","unstructured":"Shi, H., Zhang, Y., Si, Z., Wang, L., Zhao, D.: Maximal information propagation with budgets. In: ECAI 2020\u201324th European Conference on Artificial Intelligence, vol. 325, pp. 211\u2013218. IOS Press (2020)"},{"key":"4_CR15","first-page":"101","volume":"16","author":"H Steihaus","year":"1948","unstructured":"Steihaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1924421.1924441","volume":"54","author":"JC Tang","year":"2011","unstructured":"Tang, J.C., Cebri\u00e1n, M., Giacobe, N.A., Kim, H., Kim, T., Wickert, D.B.: Reflecting on the DARPA red balloon challenge. Commun. ACM 54(4), 78\u201385 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","volume":"4","author":"GJ Woeginger","year":"2007","unstructured":"Woeginger, G.J., Sgall, J.: On the complexity of cake cutting. Discret. Optim. 4(2), 213\u2013220 (2007)","journal-title":"Discret. Optim."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, X., Zhao, D.: Sybil-proof answer querying mechanism. In: Bessiere, C. (ed.) Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 422\u2013428. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/59"},{"key":"4_CR19","unstructured":"Zhang, Y., Zhao, D.: Incentives to invite others to form larger coalitions. In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, pp. 1509\u20131517 (2022)"},{"key":"4_CR20","unstructured":"Zhao, D.: Mechanism design powered by social interactions. In: AAMAS\u201921: 20th International Conference on Autonomous Agents and Multiagent Systems, pp. 63\u201367. ACM (2021)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Zhao, D.: Mechanism design powered by social interactions: a call to arms. In: Raedt, L.D. (ed.) IJCAI 2022, Vienna, Austria, 23\u201329 July 2022, pp. 5831\u20135835. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/820"},{"key":"4_CR22","unstructured":"Zhao, D., Li, B., Xu, J., Hao, D., Jennings, N.R.: Selling multiple items via social networks. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, pp. 68\u201376 (2018)"}],"container-title":["Lecture Notes in Computer Science","Distributed Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25549-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T19:00:48Z","timestamp":1729105248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25549-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031255489","9783031255496"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25549-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dai22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adai.ai\/dai\/2022\/2022.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"16","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":"5","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":"31% - 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":"3","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)"}}]}}