{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:41:02Z","timestamp":1743072062953,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030891879"},{"type":"electronic","value":"9783030891886"}],"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-89188-6_8","type":"book-chapter","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:23Z","timestamp":1635112943000},"page":"101-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Public Project with Minimum Expected Release Delay"],"prefix":"10.1007","author":[{"given":"Guanhua","family":"Wang","sequence":"first","affiliation":[]},{"given":"Mingyu","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"unstructured":"Conitzer, V., Sandholm, T.: Complexity of mechanism design. In: Darwiche, A., Friedman, N. (eds.) UAI 2002, Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence, University of Alberta, Edmonton, Alberta, Canada, 1\u20134 August 2002, pp. 103\u2013110. Morgan Kaufmann (2002)","key":"8_CR1"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0165-4896(98)00026-2","volume":"37","author":"R Deb","year":"1999","unstructured":"Deb, R., Razzolini, L.: Voluntary cost sharing for an excludable public project. Math. Soc. Sci. 37(2), 123\u2013138 (1999)","journal-title":"Math. Soc. Sci."},{"unstructured":"D\u00fctting, P., Feng, Z., Narasimhan, H., Parkes, D., Ravindranath, S.S.: Optimal auctions through deep learning. In: International Conference on Machine Learning, pp. 1706\u20131715. PMLR (2019)","key":"8_CR3"},{"unstructured":"Fisher, D.: Vupen founder launches new zero-day acquisition firm zerodium (2015), July 24, 2015 https:\/\/threatpost.com\/vupen-launches-new-zero-day-acquisition-firm-zerodium\/113933\/","key":"8_CR4"},{"unstructured":"Greenberg, A.: Shopping for zero-days: A price list for hackers\u2019 secret software exploits (2012), 23 March 2012 online: http:\/\/www.forbes.com\/sites\/andygreenberg\/2012\/03\/23\/shopping-for-zero-days-an-price-list-for-hackers-secret-software-exploits\/","key":"8_CR5"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-03098-8_11","volume-title":"PRIMA 2018: Principles and Practice of Multi-Agent Systems","author":"M Guo","year":"2018","unstructured":"Guo, M., Yang, Y., Ali Babar, M.: Cost sharing security information with minimal release delay. In: Miller, T., Oren, N., Sakurai, Y., Noda, I., Savarimuthu, B.T.R., Cao Son, T. (eds.) PRIMA 2018. LNCS (LNAI), vol. 11224, pp. 177\u2013193. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03098-8_11"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2307\/2297983","volume":"61","author":"H Moulin","year":"1994","unstructured":"Moulin, H.: Serial cost-sharing of excludable public goods. Rev. Econ. Stud. 61(2), 305\u2013325 (1994)","journal-title":"Rev. Econ. Stud."},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/game.1999.0755","volume":"32","author":"S Ohseto","year":"2000","unstructured":"Ohseto, S.: Characterizations of strategy-proof mechanisms for excludable versus nonexcludable public projects. Games Econ. Behav. 32(1), 51\u201366 (2000)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10458-009-9108-7","volume":"21","author":"S Phelps","year":"2010","unstructured":"Phelps, S., McBurney, P., Parsons, S.: Evolutionary mechanism design: a review. Auton. Agents Multi-agent Syst. 21(2), 237\u2013264 (2010)","journal-title":"Auton. Agents Multi-agent Syst."},{"unstructured":"Shen, W., Tang, P., Zuo, S.: Automated mechanism design via neural networks. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 215\u2013223. AAMAS 2019, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2019)","key":"8_CR10"},{"unstructured":"Wang, G., Guo, R., Sakurai, Y., Babar, A., Guo, M.: Mechanism design for public projects via neural networks. In: 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021) (2021)","key":"8_CR11"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2021: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89188-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:19:11Z","timestamp":1648646351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89188-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891879","9783030891886"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89188-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","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":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2021","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":"382","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":"93","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":"28","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":"24% - 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":"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)"}}]}}