In this dissertation, we define a cooperative multiagent system where the agents use locally designed Bayesian networks to represent their knowledge. Agents communi- cate via message passing where the messages are beliefs in shared variables that are represented as probability distributions. Messages are treated as soft evidence in the receiver agents, where the belief in the receiving agent is replaced by the publishing agent’s belief. We call this the oracular assumption, where one agent is an expert or more knowledgeable of particular variables. As a result, the agents are organized in a publisher-subscriber hierarchy. A central problem of message passing in prob- abilistic systems is the so called rumor problem, where cycles in message passing cause redundant influence of beliefs. We develop algorithms to identify and solve the rumor problem in the context of our multiagent system. We compare and contrast our system with the MSBN multiagent model.
Central to our agent model is the notion of soft evidential update. We develop methods to efficiently perform probabilistic update in Bayesian networks where the soft evidence is respected. We analyze the theoretical and experimental complexity of our methods and compare them with other methods that have been proposed.
Finally, we implement several multiagent systems for experimentation using our multiagent system and MSBNs. We devise performance measures to compare the two systems. From this comparison, we provide guidance for the design of probabilistic multiagent systems.
","abstract_html":"<p>In this dissertation, we define a cooperative multiagent system where the agents use locally designed Bayesian networks to represent their knowledge. Agents communi- cate via message passing where the messages are beliefs in shared variables that are represented as probability distributions. Messages are treated as soft evidence in the receiver agents, where the belief in the receiving agent is replaced by the publishing agent’s belief. We call this the oracular assumption, where one agent is an expert or more knowledgeable of particular variables. As a result, the agents are organized in a publisher-subscriber hierarchy. A central problem of message passing in prob- abilistic systems is the so called rumor problem, where cycles in message passing cause redundant influence of beliefs. We develop algorithms to identify and solve the rumor problem in the context of our multiagent system. We compare and contrast our system with the MSBN multiagent model.</p> <p>Central to our agent model is the notion of soft evidential update. We develop methods to efficiently perform probabilistic update in Bayesian networks where the soft evidence is respected. We analyze the theoretical and experimental complexity of our methods and compare them with other methods that have been proposed.</p> <p>Finally, we implement several multiagent systems for experimentation using our multiagent system and MSBNs. We devise performance measures to compare the two systems. From this comparison, we provide guidance for the design of probabilistic multiagent systems.</p>","abstract_has_math":false,"creators":["Langevin, Scott"],"institution":null,"degree_name":"Ph.D.","degree_level":"Campus Access Dissertation","degree_discipline":"Computer Science and Engineering","degree_department":null,"school":null,"contributors":["Marco Valtorta"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-01-01T08:00:00Z","date_published":"2010-01-01T08:00:00Z","updated_at":"2026-07-24T04:37:08Z","subjects":["Computer Sciences","Electrical and Computer Engineering","Engineering","Physical Sciences and Mathematics","Bayesian networks","Distributed problem solving","Multiagent Systems","Probabilistic Reasoning","Sensor Fusion","Soft Evidence"],"languages":[],"rights":["© 2010, Scott Langevin"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarcommons.sc.edu/etd/788","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Marco Valtorta"]},{"key":"dc:creator","label":"Author","values":["Langevin, Scott"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Campus Access Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Sciences","Electrical and Computer Engineering","Engineering","Physical Sciences and Mathematics","Bayesian networks","Distributed problem solving","Multiagent Systems","Probabilistic Reasoning","Sensor Fusion","Soft Evidence"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["© 2010, Scott Langevin"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarcommons.sc.edu/etd/788"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this dissertation, we define a cooperative multiagent system where the agents use locally designed Bayesian networks to represent their knowledge. Agents communi- cate via message passing where the messages are beliefs in shared variables that are represented as probability distributions. Messages are treated as soft evidence in the receiver agents, where the belief in the receiving agent is replaced by the publishing agent’s belief. We call this the oracular assumption, where one agent is an expert or more knowledgeable of particular variables. As a result, the agents are organized in a publisher-subscriber hierarchy. A central problem of message passing in prob- abilistic systems is the so called rumor problem, where cycles in message passing cause redundant influence of beliefs. We develop algorithms to identify and solve the rumor problem in the context of our multiagent system. We compare and contrast our system with the MSBN multiagent model.
Central to our agent model is the notion of soft evidential update. We develop methods to efficiently perform probabilistic update in Bayesian networks where the soft evidence is respected. We analyze the theoretical and experimental complexity of our methods and compare them with other methods that have been proposed.
Finally, we implement several multiagent systems for experimentation using our multiagent system and MSBNs. We devise performance measures to compare the two systems. From this comparison, we provide guidance for the design of probabilistic multiagent systems.
"]},{"key":"dc:title","label":"Title","values":["Knowledge Representation, Communication, and Update In Probability-Based Multiagent Systems"]}]}],"canonical_facts":{"dc:contributor":["Marco Valtorta"],"dc:creator":["Langevin, Scott"],"dc:description.abstract":["In this dissertation, we define a cooperative multiagent system where the agents use locally designed Bayesian networks to represent their knowledge. Agents communi- cate via message passing where the messages are beliefs in shared variables that are represented as probability distributions. Messages are treated as soft evidence in the receiver agents, where the belief in the receiving agent is replaced by the publishing agent’s belief. We call this the oracular assumption, where one agent is an expert or more knowledgeable of particular variables. As a result, the agents are organized in a publisher-subscriber hierarchy. A central problem of message passing in prob- abilistic systems is the so called rumor problem, where cycles in message passing cause redundant influence of beliefs. We develop algorithms to identify and solve the rumor problem in the context of our multiagent system. We compare and contrast our system with the MSBN multiagent model.
Central to our agent model is the notion of soft evidential update. We develop methods to efficiently perform probabilistic update in Bayesian networks where the soft evidence is respected. We analyze the theoretical and experimental complexity of our methods and compare them with other methods that have been proposed.
Finally, we implement several multiagent systems for experimentation using our multiagent system and MSBNs. We devise performance measures to compare the two systems. From this comparison, we provide guidance for the design of probabilistic multiagent systems.
"],"dc:identifier":["https://scholarcommons.sc.edu/etd/788"],"dc:rights":["© 2010, Scott Langevin"],"dc:subject":["Computer Sciences","Electrical and Computer Engineering","Engineering","Physical Sciences and Mathematics","Bayesian networks","Distributed problem solving","Multiagent Systems","Probabilistic Reasoning","Sensor Fusion","Soft Evidence"],"dc:title":["Knowledge Representation, Communication, and Update In Probability-Based Multiagent Systems"],"thesis:degree_discipline":["Computer Science and Engineering"],"thesis:degree_level":["Campus Access Dissertation"],"thesis:degree_name":["Ph.D."]},"updated_at":"2026-07-24T04:37:08Z"}