Decentralized team decision via coding
Sachin Adlakha, Seyed Reza Mirghaderi, Sanjay Lall, Andrea J. Goldsmith · 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.