Decentralized team decision via coding

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....

Full description

Saved in:
Bibliographic Details
Main Authors: Adlakha, S., Mirghaderi, S.R., Lall, S., Goldsmith, A.
Format: Conference Proceeding
Language:English
Subjects:
Color
Cost function
Encoding
Hydrogen
State estimation
State-space methods
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ALLERTON.2009.5394861