The DOI matches its Crossref record.
On the complexity of decentralized decision making and detection problems
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 l-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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Distributed detection with multiple sensors I. Fundamentals
Viswanathan, R., & Varshney, P. K. (1997) · Proceedings of the IEEE · doi:10.1109/5.554208 · Cited by 1,066
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
Self-citationCollaborative wideband sensing for cognitive radios
Quan, Z., Cui, S., Poor, H. V., & Sayed, A. H. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.929296 · Cited by 375
Universal Decentralized Estimation in a Bandwidth Constrained Sensor Network
Luo, Z.-Q. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847692 · Cited by 368
Designing organizational structures to cope with communication breakdowns: a simulation model
Carley, K. M. (1991) · Industrial Crisis Quarterly · doi:10.1177/108602669100500102 · Cited by 63
Metadata
- Authors
- Tsitsiklis, J., & Athans, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1985-05
- Volume
- 30
- Issue
- 5
- Pages
- 440-446
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2121154010
- Cited by
- 427
- References
- 0
- FWCI
- 10.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the complexity of decentralized decision making and detection problems. https://app.cochat.ai/papers/10.1109/tac.1985.1103988
- The paper
- Tsitsiklis, J., & Athans, M. (1985). On the complexity of decentralized decision making and detection problems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1985.1103988
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
