{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:47:09Z","timestamp":1726062429491},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030374938"},{"type":"electronic","value":"9783030374945"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-37494-5_4","type":"book-chapter","created":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T15:02:38Z","timestamp":1576335758000},"page":"55-71","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A General Approach to Distributed and Privacy-Preserving Heuristic Computation"],"prefix":"10.1007","author":[{"given":"Michal","family":"\u0160tolba","sequence":"first","affiliation":[]},{"given":"Michaela","family":"Urbanovsk\u00e1","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Fi\u0161er","sequence":"additional","affiliation":[]},{"given":"Anton\u00edn","family":"Komenda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,15]]},"reference":[{"key":"4_CR1","unstructured":"Brafman, R.I.: A privacy preserving algorithm for multi-agent planning and search. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI, pp. 1530\u20131536 (2015)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Dreier, J., Kerschbaum, F.: Practical privacy-preserving multiparty linear programming based on problem transformation. In: Proceedings of IEEE 3rd International Conference on Privacy, Security, Risk and Trust (PASSAT) and IEEE 3rd Third Inernational Conference on Social Computing (SocialCom), pp. 916\u2013924 (2011)","DOI":"10.1109\/PASSAT\/SocialCom.2011.19"},{"key":"4_CR3","unstructured":"Fi\u0161er, D., \u0160tolba, M., Komenda, A.: MAPlan. In: Proceedings of the Competition of Distributed and Multi-Agent Planners (CoDMAP-2015), pp. 8\u201310 (2015)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Helmert, M., Domshlak, C.: Landmarks, critical paths and abstractions: what\u2019s the difference anyway? In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS), pp. 162\u2013169 (2009)","DOI":"10.1609\/icaps.v19i1.13370"},{"key":"4_CR5","unstructured":"Karpas, E., Domshlak, C.: Cost-optimal planning with landmarks. In: IJCAI, pp. 1728\u20131733 (2009)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Karpas, E., Katz, M., Markovitch, S.: When optimal is just not good enough: learning fast informative action cost partitionings. In: ICAPS (2011)","DOI":"10.1609\/icaps.v21i1.13447"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1613\/jair.3063","volume":"39","author":"M Katz","year":"2010","unstructured":"Katz, M., Domshlak, C.: Implicit abstraction heuristics. J. Artif. Intell. Res. 39, 51\u2013126 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"12\u201313","key":"4_CR8","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.artint.2010.04.021","volume":"174","author":"M Katz","year":"2010","unstructured":"Katz, M., Domshlak, C.: Optimal admissible composition of abstraction heuristics. Artif. Intell. 174(12\u201313), 767\u2013798 (2010)","journal-title":"Artif. Intell."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1609\/aimag.v37i3.2658","volume":"37","author":"A Komenda","year":"2016","unstructured":"Komenda, A., Stolba, M., Kovacs, D.L.: The international competition of distributed and multiagent planners (CoDMAP). AI Mag. 37(3), 109\u2013115 (2016)","journal-title":"AI Mag."},{"key":"4_CR10","unstructured":"Maliah, S., Brafman, R.I., Shani, G.: Privacy preserving LAMA. In: Proceedings of the 4th Workshop on Distributed and Multi-Agent Planning, DMAP-ICAPS 2016, pp. 1\u20135 (2016)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11590-010-0199-5","volume":"5","author":"OL Mangasarian","year":"2011","unstructured":"Mangasarian, O.L.: Privacy-preserving linear programming. Opt. Lett. 5(1), 165\u2013172 (2011)","journal-title":"Opt. Lett."},{"key":"4_CR12","unstructured":"Nissim, R., Brafman, R.I.: Multi-agent A* for parallel and distributed systems. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), pp. 1265\u20131266 (2012)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1613\/jair.4295","volume":"51","author":"R Nissim","year":"2014","unstructured":"Nissim, R., Brafman, R.I.: Distributed heuristic forward search for multi-agent planning. J. Artif. Intell. Res. 51, 293\u2013332 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Pommerening, F., Helmert, M., R\u00f6ger, G., Seipp, J.: From non-negative to general operator cost partitioning: Proof details. Technical Report CS-2014-005, University of Basel, Department of Mathematics and Computer Science (2014)","DOI":"10.1609\/aaai.v29i1.9668"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Seipp, J., Keller, T., Helmert, M.: A comparison of cost partitioning algorithms for optimal classical planning (2017)","DOI":"10.1609\/icaps.v27i1.13823"},{"key":"4_CR16","unstructured":"Sheikh, R., Kumar, B., Mishra, D.K.: A distributed k-secure sum protocol for secure multi-party computations. arXiv preprint arXiv:1003.4071 (2010)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Fi\u0161er, D., Komenda, A.: Admissible landmark heuristic for multi-agent planning. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS), pp. 211\u2013219 (2015)","DOI":"10.1609\/icaps.v25i1.13719"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Fi\u0161er, D., Komenda, A.: Potential heuristics for multi-agent planning. In: Proceedings of the 26th International Conference on Automated Planning and Scheduling, ICAPS 2016, pp. 308\u2013316 (2016)","DOI":"10.1609\/icaps.v26i1.13757"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Fi\u0161er, D., Komenda, A.: Privacy leakage of search-based multi-agent planning algorithms. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019 (2019)","DOI":"10.1609\/icaps.v29i1.3513"},{"key":"4_CR20","first-page":"28","volume":"18","author":"M \u0160tolba","year":"2017","unstructured":"\u0160tolba, M., To\u017ei\u010dka, J., Komenda, A.: Quantifying privacy leakage in multi-agent planning. ACM Trans. Internet Technol. (TOIT) 18, 28 (2017)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Urbanovsk\u00e1, M., Fi\u0161er, D., Komenda, A.: Cost partitioning for multi-agent planning. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART (2019)","DOI":"10.5220\/0007256600400049"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10489-014-0540-2","volume":"41","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o, A., Onaindia, E., Sapena, O.: FMAP: distributed cooperative multi-agent planning. Appl. Intell. 41(2), 606\u2013626 (2014)","journal-title":"Appl. Intell."},{"issue":"6","key":"4_CR23","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3128584","volume":"50","author":"A Torre\u00f1o","year":"2017","unstructured":"Torre\u00f1o, A., Onaindia, E., Komenda, A., \u0160tolba, M.: Cooperative multi-agent planning: a survey. ACM Comput. Surv. (CSUR) 50(6), 84 (2017)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"4_CR24","unstructured":"To\u017ei\u010dka, J., Jakubuv, J., Komenda, A.: Generating multi-agent plans by distributed intersection of Finite State Machines. In: Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), pp. 1111\u20131112 (2014)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"To\u017ei\u010dka, J., \u0160tolba, M., Komenda, A.: The limits of strong privacy preserving multi-agent planning. In: Proceedings of the 27th International Conference on Automated Planning and Scheduling, ICAPS 2017 (2017)","DOI":"10.1609\/icaps.v27i1.13828"},{"issue":"4","key":"4_CR26","doi-asserted-by":"publisher","first-page":"451","DOI":"10.3233\/MGS-2009-0135","volume":"5","author":"R Krogt Van Der","year":"2009","unstructured":"Van Der Krogt, R.: Quantifying privacy in multiagent planning. Multiagent Grid Syst. 5(4), 451\u2013469 (2009)","journal-title":"Multiagent Grid Syst."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37494-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T13:18:41Z","timestamp":1665235121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37494-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030374938","9783030374945"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37494-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaart2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaart.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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"202","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":"46","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":"66","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":"23% - 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":"4","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)"}},{"value":"36 poster papers were also accepted. 17 of the 46 accepted full papers are included in LNAI 11978.","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)"}}]}}