Decentralized team decision via coding

Sachin Adlakha, Seyed Reza Mirghaderi, Sanjay Lall, Andrea Goldsmith

Abstract

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.
BibTeX
@inproceedings{adlakha2009decentralized,
  author = {Sachin Adlakha and Seyed Reza Mirghaderi and Sanjay Lall and Andrea Goldsmith},
  title = {{Decentralized team decision via coding}},
  booktitle = {Allerton},
  year = {2009},
  doi = {10.1109/allerton.2009.5394861},
}

Loading related content...

Figure