Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree

Xiang, Yang; Srinivasan, Kamala

doi:10.1007/978-3-642-38457-8_17

Cited by 2 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm guarantees agent privacy on private variables, shared variables, as well as agent identity. To the best of our knowledge, no existing JT-based MAS frameworks provide the same degree of agent privacy, except a related work based on distributed maximum spanning tree construction which we report in [13].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization

Xiang

Srinivasan

2013

Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

Some of the essential tasks of a multiagent system (MAS) include distributed probabilistic reasoning, constraint reasoning, and decision making. Junction tree (JT) based agent organizations have been adopted by some MAS frameworks for their advantages of efficient communication and sound inference. In addition, JT organizations have the potential capacity to support a high degree of agent privacy. This potential, however, has not been fully realized. We present two necessary and sufficient conditions on the existence of JT organization given a MAS. Following these conditions, we propose a new algorithm suite, based on elimination in the so called boundary set of a MAS, that recognizes JT organization existence and constructs one if exists, while guaranteeing agent privacy on private variables, shared variables and agent identities.

show abstract

Section: Resultsmentioning

confidence: 99%

“…The boundary set of a MAS can play an important role in privacy preserving construction of JT organizations, as established by a proposition from [13].…”

Section: Problem Definitionmentioning

confidence: 99%

Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization

Xiang

Srinivasan

2013

Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

show abstract

Privacy preserving existence recognition and construction of hypertree agent organization

Xiang

Srinivasan

2015

Auton Agent Multi-Agent Syst

Self Cite

View full text Add to dashboard Cite

Decentralized probabilistic reasoning, constraint reasoning, and decision theoretic reasoning are some essential tasks of cooperative multiagent systems. Several frameworks for these tasks organize agents into a junction tree (JT). We show that existing techniques for JT existence recognition and construction leak information on private variables, shared variables, agent identities and adjacency, that can potentially be protected. We present a scheme to quantify these privacy losses. We develop two novel algorithms for JT existence recognition and for JT construction when existing, that provide strong guarantee of agent privacy. Our experimental comparison shows that the proposed algorithms out-perform existing techniques, one of them having the lowest privacy loss and the other having no privacy loss, while being more efficient than most alternatives.

show abstract

Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree

Cited by 2 publications

References 20 publications

Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization

Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization

Privacy preserving existence recognition and construction of hypertree agent organization

Contact Info

Product

Resources

About