• DocumentCode
    3062977
  • Title

    On the complexity of decentralized decision making and detection problems

  • Author

    Tsitsiklis, J.N. ; Athans, M.

  • Author_Institution
    Massachusetts Institute of Technology, Cambridge, Massachusetts
  • fYear
    1984
  • fDate
    12-14 Dec. 1984
  • Firstpage
    1638
  • Lastpage
    1641
  • Abstract
    We study the computational complexity of the discrete versions of some simple but basic decentralized decision problems. These problems are variations of the classical "team decision problem" and include the problem of decentralized detection, whereby a central processor is to select one of two hypotheses, based on 1-bit messages from two noncommunicating sensors. Our results point to the inherent difficulty of decentralized decision making and suggest that optimality may be an elusive goal.
  • Keywords
    Computational complexity; Decision making; Heuristic algorithms; Optimal control; Polynomials; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1984. The 23rd IEEE Conference on
  • Conference_Location
    Las Vegas, Nevada, USA
  • Type

    conf

  • DOI
    10.1109/CDC.1984.272358
  • Filename
    4048176
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3062977