Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Complexity of Bayesian Belief Exchange over a Network

Complexity of Bayesian Belief Exchange over a Network

Thumbnail Image
Download
Name

Mossel - conf paper for CDC 2017.pdf

Size

340.53 KB

Format

Adobe PDF

Checksum (MD5)

3aba0e1054331975c50f1a806dada349

Author(s)
Mossel, Elchanan
•
Rahimian, Mohammad Amin
•
Jadbabaie-Moghadam, Ali
Date Issued
December 2017
Journal
2017 IEEE 56th Annual Conference on Decision and Control (CDC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Rahimian, M. Amin, Ali Jadbabaie, and Elchanan Mossel. “Complexity of Bayesian Belief Exchange over a Network.” 2017 IEEE 56th Annual Conference on Decision and Control (CDC) (December 2017).
Version
Author's final manuscript
Abstract
Many important real-world decision making prob- lems involve group interactions among individuals with purely informational externalities, such situations arise for example in jury deliberations, expert committees, medical diagnosis, etc. In this paper, we will use the framework of iterated eliminations to model the decision problem as well as the thinking process of a Bayesian agent in a group decision/discussion scenario. We model the purely informational interactions of rational agents in a group, where they receive private information and act based upon that information while also observing other people’s beliefs. As the Bayesian agent attempts to infer the true state of the world from her sequence of observations which include her neighbors’ beliefs as well as her own private signal, she recursively refines her belief about the signals that other players could have observed and beliefs that they would have hold given the assumption that other players are also rational. We further analyze the computational complexity of the Bayesian belief formation in groups and show that it is NP -hard. We also investigate the factors underlying this computational complexity and show how belief calculations simplify in special network structures or cases with strong inherent symmetries. We finally give insights about the statistical efficiency (optimality) of the beliefs and its relations to computational efficiency.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/116568
DOI of Published Version
https://doi.org/10.1109/CDC.2017.8264038
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.