TY - GEN
T1 - Coding strategies for a class of decentralized control problems with limited communication
AU - Mirghaderi, Reza
AU - Lall, Sanjay
AU - Goldsmith, Andrea
PY - 2011
Y1 - 2011
N2 - We propose a large class of decentralized control problems with non-classical information structure for which a coding strategy is optimal. This class is a generalized version of the hats problem with statistically dependent hat colors where implicit communication via action is allowed. We propose a sufficient condition on the joint distribution of the hat colors which guarantees the optimality of a binary sum coding strategy. We explore the connection between this version of the hats problem and hypercube graph theory, and use that to show that verifying our proposed sufficient condition is computationally tractable.
AB - We propose a large class of decentralized control problems with non-classical information structure for which a coding strategy is optimal. This class is a generalized version of the hats problem with statistically dependent hat colors where implicit communication via action is allowed. We propose a sufficient condition on the joint distribution of the hat colors which guarantees the optimality of a binary sum coding strategy. We explore the connection between this version of the hats problem and hypercube graph theory, and use that to show that verifying our proposed sufficient condition is computationally tractable.
UR - https://www.scopus.com/pages/publications/84860676063
U2 - 10.1109/CDC.2011.6161001
DO - 10.1109/CDC.2011.6161001
M3 - Conference contribution
AN - SCOPUS:84860676063
SN - 9781612848006
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 4809
EP - 4816
BT - 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
Y2 - 12 December 2011 through 15 December 2011
ER -