Decentralized team decision via coding

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publication2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages151
Number of pages1
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States
Duration: Sep 30 2009Oct 2 2009

Publication series

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

Other

Other2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
CountryUnited States
CityMonticello, IL
Period9/30/0910/2/09

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Control and Systems Engineering
  • Communication

Fingerprint Dive into the research topics of 'Decentralized team decision via coding'. Together they form a unique fingerprint.

Cite this