{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:39:43Z","timestamp":1742924383991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030030971"},{"type":"electronic","value":"9783030030988"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03098-8_11","type":"book-chapter","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T12:27:33Z","timestamp":1540297653000},"page":"177-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cost Sharing Security Information with Minimal Release Delay"],"prefix":"10.1007","author":[{"given":"Mingyu","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Ali Babar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"issue":"3","key":"11_CR1","first-page":"482","volume":"8","author":"A Algarni","year":"2014","unstructured":"Algarni, A., Malaiya, Y.: Software vulnerability markets: discoverers and buyers. Int. J. Comput. Inf. Sci. Eng. 8(3), 482\u2013484 (2014)","journal-title":"Int. J. Comput. Inf. Sci. Eng."},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1287\/mnsc.1070.0771","volume":"54","author":"A Arora","year":"2008","unstructured":"Arora, A., Telang, R., Xu, H.: Optimal policy for software vulnerability disclosure. Manage. Sci. 54(4), 642\u2013656 (2008)","journal-title":"Manage. Sci."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11766155_21","volume-title":"Emerging Trends in Information and Communication Security","author":"R B\u00f6hme","year":"2006","unstructured":"B\u00f6hme, R.: A comparison of market approaches to software vulnerability disclosure. In: M\u00fcller, G. (ed.) ETRICS 2006. LNCS, vol. 3995, pp. 298\u2013311. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11766155_21"},{"key":"11_CR4","unstructured":"Canfield, C., Catota, F., Rajkarnikar, N.: A national cyber bug broker: retrofitting transparency (2015). https:\/\/www.andrew.cmu.edu\/user\/ccanfiel\/National-Cyber-Bug-Broker_final.pdf"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-44832-9_15","volume-title":"PRIMA 2016: Princiles and Practice of Multi-Agent Systems","author":"M Guo","year":"2016","unstructured":"Guo, M., Hata, H., Babar, A.: Revenue maximizing markets for zero-day exploits. In: Baldoni, M., Chopra, A.K., Son, T.C., Hirayama, K., Torroni, P. (eds.) PRIMA 2016. LNCS (LNAI), vol. 9862, pp. 247\u2013260. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44832-9_15"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-69131-2_17","volume-title":"PRIMA 2017: Principles and Practice of Multi-Agent Systems","author":"M Guo","year":"2017","unstructured":"Guo, M., Hata, H., Babar, A.: Optimizing affine maximizer auctions via linear programming: an application to revenue maximizing mechanism design for zero-day exploits markets. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds.) PRIMA 2017. LNCS (LNAI), vol. 10621, pp. 280\u2013292. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69131-2_17"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1613\/jair.3810","volume":"46","author":"M Guo","year":"2013","unstructured":"Guo, M., Markakis, E., Apt, K.R., Conitzer, V.: Undominated groves mechanisms. J. Artif. Intell. Res. 46, 129\u2013163 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781420091281","volume-title":"Cyber Fraud: Tactics, Techniques and Procedures","author":"R Howard","year":"2009","unstructured":"Howard, R.: Cyber Fraud: Tactics, Techniques and Procedures. CRC Press, Boca Raton (2009)"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1287\/mnsc.1040.0357","volume":"51","author":"K Kannan","year":"2005","unstructured":"Kannan, K., Telang, R.: Market for software vulnerabilities? Think again. Manage. Sci. 51(5), 726\u2013740 (2005)","journal-title":"Manage. Sci."},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/cybsec\/tyx008","volume":"3","author":"T Maillart","year":"2017","unstructured":"Maillart, T., Zhao, M., Grossklags, J., Chuang, J.: Given enough eyeballs, all bugs are shallow? Revisiting eric raymond with bug bounty programs. J. Cybersecur. 3(2), 81\u201390 (2017)","journal-title":"J. Cybersecur."},{"key":"11_CR11","unstructured":"Miller, C.: The legitimate vulnerability market: inside the secretive world of 0-day exploit sales. In: Sixth Workshop on the Economics of Information Security (2007)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.infoecopol.2006.10.001","volume":"19","author":"D Nizovtsev","year":"2007","unstructured":"Nizovtsev, D., Thursby, M.: To disclose or not? An analysis of software user behavior. Inf. Econ. Policy 19(1), 43\u201364 (2007)","journal-title":"Inf. Econ. Policy"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2018: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03098-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T18:03:15Z","timestamp":1703181795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03098-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030030971","9783030030988"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03098-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.prima-conference.org\/","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":"103","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":"25","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":"33","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}