Main content

Privacy Preserving Distributed Computation of Hypertree Multiagent Organization

Show simple item record

dc.contributor.advisor Xiang, Yang
dc.contributor.author Srinivasan, Kamala
dc.date.accessioned 2013-08-29T15:10:46Z
dc.date.available 2013-08-29T15:10:46Z
dc.date.copyright 2013-08
dc.date.created 2013-08-21
dc.date.issued 2013-08-29
dc.identifier.uri http://hdl.handle.net/10214/7436
dc.description.abstract Probabilistic reasoning, constraint reasoning, and decision theoretic reasoning are some of the essential tasks of multiagent systems. Many multiagent system frameworks exist to support these tasks. Some of these frameworks organize the agents into a structure called hypertree. The advantages of an hypertree organization include communication efficiency, inferential soundness and a high degree of agent privacy during normal inference operations. However, during hypertree organization construction, agent privacy may be compromised, and it is so for all existing hypertree based multiagent system frameworks. In this work, we propose distributed algorithms to recognize whether a hypertree organization exists for a given multiagent system, and if so, construct one. During the recognition and construction, our algorithms preserve agent privacy on private variables, shared variables, agent identities and bordering relations. en_US
dc.language.iso en en_US
dc.title Privacy Preserving Distributed Computation of Hypertree Multiagent Organization en_US
dc.type Thesis en_US
dc.degree.programme Computer Science en_US
dc.degree.name Master of Science en_US
dc.degree.department School of Computer Science en_US
dc.rights.license All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.


Files in this item

Files Size Format View
Srinivasan_Kamala_201308_MSc.PDF 1.103Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record