Privacy sensitive environment re-decomposition for junction tree agent organization construction

A number of frameworks for decentralized probabilistic reasoning, constraint reasoning, and decision theoretic reasoning assume a junction tree agent organization (JT-org). A natural decomposition of agent environment may not admit a JT-org. Hence, JT-org construction involves three related tasks: (1) Recognize whether a JT-org exists for a given environment decomposition. (2) When JT-orgs exist, construct one. (3) When no JT-org exists, revise the environment decomposition so that one exists and then construct it. Task 3 requires re-decomposition of the environment. However, re-decomposition incurs loss of JT-org linked privacy, including agent privacy, topology privacy, privacy on private variables, and privacy on shared variables. We propose a novel algorithm suite Distributed Agent Environment Re-decomposition (DAER) that accomplishes all three tasks distributively. For Tasks 1 and 2, DAER incurs no loss of JT-org linked privacy. For Task 3, it incurs significantly less privacy loss than existing JT-org construction methods. Performance of DAER is formally analyzed and empirically evaluated.

[1]  Michael Luck,et al.  Cooperation Emergence under Resource-Constrained Peer Punishment , 2016, AAMAS.

[2]  Yang Xiang,et al.  PROBABILISTIC REASONING IN MULTIAGENT SYSTEMS: A GRAPHICAL MODELS APPROACH, by Yang Xiang, Cambridge University Press, Cambridge, 2002, xii + 294 pp., ISBN 0-521-81308-5 (Hardback, £45.00). , 2002, Robotica.

[3]  Enrico Pontelli,et al.  ER-DCOPs: A Framework for Distributed Constraint Optimization with Uncertainty in Constraint Utilities , 2016, AAMAS.

[4]  Yang Xiang,et al.  Multiagent Decision Making in Collaborative Decision Networks by Utility Cluster Based Partial Evaluation , 2015, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[5]  Boi Faltings,et al.  Protecting Privacy through Distributed Computation in Multi-agent Decision Making , 2013, J. Artif. Intell. Res..

[6]  Robert J. McEliece,et al.  The generalized distributive law , 2000, IEEE Trans. Inf. Theory.

[7]  Makoto Yokoo,et al.  Proactive Dynamic Distributed Constraint Optimization , 2016, AAMAS.

[8]  Tamir Tassa,et al.  Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants , 2017, J. Artif. Intell. Res..

[9]  Pedro Meseguer,et al.  Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees , 2010, Fundam. Informaticae.

[10]  Christian Bessiere,et al.  Improving Asynchronous Backtracking for Dealing with Complex Local Problems , 2004, ECAI.

[11]  Daphne Koller,et al.  Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.

[12]  Meritxell Vinyals,et al.  Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law , 2010, Autonomous Agents and Multi-Agent Systems.

[13]  Yang Xiang,et al.  Privacy preserving existence recognition and construction of hypertree agent organization , 2015, Autonomous Agents and Multi-Agent Systems.

[14]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[15]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[16]  Yang Xiang,et al.  Building Intelligent Sensor Networks with Multiagent Graphical Models , 2008, Intelligent Decision Making: An AI-Based Approach.

[17]  Yang Gao,et al.  Argumentation-Based Multi-Agent Decision Making with Privacy Preserved , 2016, AAMAS.

[18]  Makoto Yokoo,et al.  Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information , 2002, CP.

[19]  Milind Tambe,et al.  Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications , 2006, Autonomous Agents and Multi-Agent Systems.

[20]  Yang Xiang,et al.  A Probabilistic Framework for Cooperative Multi-Agent Distributed Interpretation and Optimization of Communication , 1996, Artif. Intell..

[21]  Jirí Vomlel,et al.  Soft evidential update for probabilistic multiagent systems , 2002, Int. J. Approx. Reason..

[22]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..