Decentralized Team Decision via Coding
- S. Adlakha, S. R. Mirghaderi, S. Lall and A. Goldsmith.
- Proceedings of the Allerton Conference on Communication, Control and Computing, p. 151--151, 2009.
We consider a class of decentralized team decision problems with non classical information structure and discrete state spaces. In general, decentralized team decision problems are NP-complete. In this paper, we present a simple class of problems where an optimal solution can be obtained via coding. This class is motivated by a famous mathematical puzzle called the hats problem.