论文标题
私人多代理计划类似物流的问题
Differentially Private Multi-Agent Planning for Logistic-like Problems
论文作者
论文摘要
计划是通过事先制定计划来提高代理工作效率的主要方法之一。但是，在计划中，代理商面临泄漏私人信息的风险。本文提出了一种针对类似物流的问题的新颖强大的隐私计划方法。这种方法通过解决两个挑战来优于现有方法：1）同时实现强大的隐私，完整性和效率，以及2）解决沟通约束。这两个挑战在许多现实世界应用中都普遍存在，包括军事环境中的物流和网络中的数据包路由。为了应对这两个挑战，我们的方法采用了差异隐私技术，这既可以保证牢固的隐私和控制沟通开销。据我们所知，本文是第一个将差异隐私应用于多代理计划领域的文章，以此来保存代理商对物流式问题的隐私。从理论上讲，我们证明了我们方法的强烈隐私和完整性，并在经验上证明了其效率。我们还理论上分析了方法的通信开销，并说明了如何使用差异隐私来控制它。
Planning is one of the main approaches used to improve agents' working efficiency by making plans beforehand. However, during planning, agents face the risk of having their private information leaked. This paper proposes a novel strong privacy-preserving planning approach for logistic-like problems. This approach outperforms existing approaches by addressing two challenges: 1) simultaneously achieving strong privacy, completeness and efficiency, and 2) addressing communication constraints. These two challenges are prevalent in many real-world applications including logistics in military environments and packet routing in networks. To tackle these two challenges, our approach adopts the differential privacy technique, which can both guarantee strong privacy and control communication overhead. To the best of our knowledge, this paper is the first to apply differential privacy to the field of multi-agent planning as a means of preserving the privacy of agents for logistic-like problems. We theoretically prove the strong privacy and completeness of our approach and empirically demonstrate its efficiency. We also theoretically analyze the communication overhead of our approach and illustrate how differential privacy can be used to control it.
