The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach
Open accessAbstract
A general model of decentralized stochastic control called partial history sharing information structure is presented. In this model, at each step the controllers share part of their observation and control history with each other. This general model subsumes several existing models of information sharing as special cases. Based on the information commonly known to all the controllers, the decentralized problem is reformulated as an equivalent centralized problem from the perspective of a coordinator. The coordinator knows the common information and selects prescriptions that map each controller's local information to its control actions. The optimal control problem at the coordinator is shown to be a partially observable Markov decision process (POMDP) which is solved using techniques from Markov decision theory. This approach provides 1) structural results for optimal strategies and 2) a dynamic program for obtaining optimal strategies for all controllers in the original decentralized problem. Thus, this approach unifies the various ad-hoc approaches taken in the literature. In addition, the structural results on optimal control strategies obtained by the proposed approach cannot be obtained by the existing generic approach (the person-by-person approach) for obtaining structural results in decentralized problems; and the dynamic program obtained by the proposed approach is simpler than that obtained by the existing generic approach (the designer's approach) for obtaining dynamic programs in decentralized problems.
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
Cites
Detection with Distributed Sensors
Tenney, R., & Sandell, N. (1981) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1981.309178 · Cited by 846
A Characterization of Convex Problems in Decentralized Control$^ast$
Rotkowitz, M., & Lall, S. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.860365 · Cited by 681
Radner, R. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704455 · Cited by 673
Team decision theory and information structures in optimal control problems--Part I
Ho, Y., & Chu, K.-C. (1972) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1972.1099850 · Cited by 630
Separation of estimation and control for discrete time systems
Witsenhausen, H. S. (1971) · Proceedings of the IEEE · doi:10.1109/proc.1971.8488 · Cited by 519
Team decision theory and information structures
Ho, Y.-C. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11718 · Cited by 343
Decentralized quickest change detection
Veeravalli, V. V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923755 · Cited by 205
Decentralized sequential detection with a fusion center performing the sequential test
Veeravalli, V. V., Başar, T., & Poor, H. V. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.212274 · Cited by 202
A standard form for sequential stochastic control
Witsenhausen, H. S. (1973) · Theory of Computing Systems · doi:10.1007/bf01824800 · Cited by 120
Varaiya, P. P., & Walrand, J. C. (1978) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1978.1101739 · Cited by 105
Cited by
Cooperative Inverse Reinforcement Learning
Hadfield-Menell, D., Dragan, A., Abbeel, P., & Russell, S. (2016) · arXiv · doi:10.48550/arxiv.1606.03137 · Cited by 413
Communication-Efficient Policy Gradient Methods for Distributed Reinforcement Learning
Chen, T., Zhang, K., Giannakis, G. B., & Basar, T. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3078100 · Cited by 67
Data-driven event triggering for IoT applications
Kolios, P., Panayiotou, C., Ellinas, G., & Polycarpou, M. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2564428 · Cited by 60
Memory-Limited Partially Observable Stochastic Control and Its Mean-Field Control Approach
Tottori, T., & Kobayashi, T. J. (2022) · Entropy · doi:10.3390/e24111599 · Cited by 11
Decentralized Stochastic Control with Finite-Dimensional Memories: A Memory Limitation Approach
Tottori, T., & Kobayashi, T. J. (2023) · Entropy · doi:10.3390/e25050791 · Cited by 7
Metadata
- Authors
- Nayyar, A., Mahajan, A., & Teneketzis, D.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2013-07
- Volume
- 58
- Issue
- 7
- Pages
- 1644-1658
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1991888757
- Cited by
- 269
- References
- 18
- FWCI
- 27.20
- Type
- journal article
- Language
- en
- Open access
- green
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: Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach. https://app.cochat.ai/papers/10.1109/tac.2013.2239000
- The paper
- Nayyar, A., Mahajan, A., & Teneketzis, D. (2013). Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2013.2239000
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.