{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:21Z","timestamp":1750306101353,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T00:00:00Z","timestamp":1517788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["15-20433Y"],"award-info":[{"award-number":["15-20433Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Grant Agency of the Czech Technical University in Prague","award":["SGS16\/235\/OHK3\/3T\/13"],"award-info":[{"award-number":["SGS16\/235\/OHK3\/3T\/13"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2018,8,31]]},"abstract":"<jats:p>Multi-agent planning using MA-STRIPS\u2013related models is often motivated by the preservation of private information. Such a motivation is not only natural for multi-agent systems but also is one of the main reasons multi-agent planning problems cannot be solved with a centralized approach. Although the motivation is common in the literature, the formal treatment of privacy is often missing. In this article, we expand on a privacy measure based on information leakage introduced in previous work, where the leaked information is measured in terms of transition systems represented by the public part of the problem with regard to the information obtained during the planning process. Moreover, we present a general approach to computing privacy leakage of search-based multi-agent planners by utilizing search-tree reconstruction and classification of leaked superfluous information about the applicability of actions. Finally, we present an analysis of the privacy leakage of two well-known algorithms\u2014multi-agent forward search (MAFS) and Secure-MAFS\u2014both in general and on a particular example. The results of the analysis show that Secure-MAFS leaks less information than MAFS.<\/jats:p>","DOI":"10.1145\/3133326","type":"journal-article","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T18:13:28Z","timestamp":1517940808000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Quantifying Privacy Leakage in Multi-Agent Planning"],"prefix":"10.1145","volume":"18","author":[{"given":"Michal","family":"\u0160tolba","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"To\u017ei\u010dka","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton\u00edn","family":"Komenda","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832415.2832462"},{"volume-title":"Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS\u201908)","author":"Ronen","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIIAT.2008.177"},{"volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence (AAAI\u201906)","year":"2006","author":"Greenstadt Rachel","key":"e_1_2_1_5_1"},{"volume-title":"Proceedings of the 5th International Conference on Artificial Intelligence (ICAPS\u201900)","year":"2000","author":"Haslum Patrik","key":"e_1_2_1_6_1"},{"volume-title":"Proceedings of the 26th International Conference on Automated Planning and Scheduling.","year":"2016","author":"Maliah Shlomi","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-016-9333-9"},{"volume-title":"Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201912)","author":"Nissim Raz","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750423.2750431"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00596-1_21"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970030.2970042"},{"volume-title":"Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI\u201916)","year":"2016","author":"\u0160tolba Michal","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0540-2"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0887-7"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1735317.1735320"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133326","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:34Z","timestamp":1750217434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,8,31]]}},"alternative-id":["10.1145\/3133326"],"URL":"https:\/\/doi.org\/10.1145\/3133326","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2018,2,5]]},"assertion":[{"value":"2016-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}