On the Complexity of Decentralized Decision Making and Detection Problems,

Abstract

The authors 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 non-communicating sensors. Results point to the inherent difficulty of decentralized decision making and suggest that optimality may be an elusive goal. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 16, 1984
Accession Number
ADA140115

Entities

People

  • J. N. Tsitsiklis
  • M. Athans

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Human Systems
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computer Science
  • Computers
  • Detection
  • Detectors
  • Dynamic Programming
  • Electrical Engineering
  • Engineering
  • Information Theory
  • Numbers
  • Observation
  • Polynomials
  • Probability
  • Signal Processing
  • Stochastic Control
  • Two Dimensional

Readers

  • Approximation Theory.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.