Decentralized team decision via coding

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

doi:10.1109/ALLERTON.2009.5394861

Decentralized team decision via coding

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

Stony Brook University

Stanford University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English
Title of host publication	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages	151
Number of pages	1
DOIs	https://doi.org/10.1109/ALLERTON.2009.5394861
State	Published - 2009
Event	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States Duration: Sep 30 2009 → Oct 2 2009

Publication series

Name	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Conference

Conference	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Country/Territory	United States
City	Monticello, IL
Period	09/30/09 → 10/2/09

Access to Document

10.1109/ALLERTON.2009.5394861

Cite this

Adlakha, S., Mirghaderi, S. R., Lall, S., & Goldsmith, A. (2009). Decentralized team decision via coding. In 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 (pp. 151). Article 5394861 (2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009). https://doi.org/10.1109/ALLERTON.2009.5394861

@inproceedings{6eefcd66bbe147b4b7d08409997c467e,

title = "Decentralized team decision via coding",

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

author = "Sachin Adlakha and Mirghaderi, \{Seyed Reza\} and Sanjay Lall and Andrea Goldsmith",

year = "2009",

doi = "10.1109/ALLERTON.2009.5394861",

language = "English",

isbn = "9781424458714",

series = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009",

pages = "151",

booktitle = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009",

note = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 ; Conference date: 30-09-2009 Through 02-10-2009",

}

Adlakha, S, Mirghaderi, SR, Lall, S & Goldsmith, A 2009, Decentralized team decision via coding. in 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009., 5394861, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, pp. 151, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, United States, 09/30/09. https://doi.org/10.1109/ALLERTON.2009.5394861

Decentralized team decision via coding. / Adlakha, Sachin; Mirghaderi, Seyed Reza; Lall, Sanjay et al.
2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009. 2009. p. 151 5394861 (2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Decentralized team decision via coding

AU - Adlakha, Sachin

AU - Mirghaderi, Seyed Reza

AU - Lall, Sanjay

AU - Goldsmith, Andrea

PY - 2009

Y1 - 2009

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

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

UR - https://www.scopus.com/pages/publications/77949579040

U2 - 10.1109/ALLERTON.2009.5394861

DO - 10.1109/ALLERTON.2009.5394861

M3 - Conference contribution

AN - SCOPUS:77949579040

SN - 9781424458714

T3 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

SP - 151

BT - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

T2 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Y2 - 30 September 2009 through 2 October 2009

ER -

Decentralized team decision via coding

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this