Title :
Decentralized team decision via coding
Author :
Adlakha, Sachin ; Mirghaderi, Seyed Reza ; Lall, Sanjay ; Goldsmith, Andrea
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
fDate :
Sept. 30 2009-Oct. 2 2009
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.
Keywords :
computational complexity; decision theory; game theory; Coding; NP; decentralized team decision problems; discrete state spaces; mathematical puzzle; non classical information structure; optimal solution; Color; Cost function; Encoding; Hydrogen; State estimation; State-space methods;
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394861
