skip to content
On the Complexity of Decentralized Decision Making and Detection Problems. Preview this item
ClosePreview this item
Checking...

On the Complexity of Decentralized Decision Making and Detection Problems.

Author: J N Tsitsiklis; M Athans; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
Publisher: Ft. Belvoir Defense Technical Information Center 16 MAR 1984.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
The authors study the computational complexity of the discrete versions of some simple but basic decentralized decision problems. These problems are variations of the classical 'team decision problem' and include the problem of decentralized detection, whereby a central processor is to select one of two hypotheses, based on 1-bit messages from two non-communicating sensors. Results point to the inherent difficulty  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: J N Tsitsiklis; M Athans; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
OCLC Number: 227611509
Description: 32 p.

Abstract:

The authors study the computational complexity of the discrete versions of some simple but basic decentralized decision problems. These problems are variations of the classical 'team decision problem' and include the problem of decentralized detection, whereby a central processor is to select one of two hypotheses, based on 1-bit messages from two non-communicating sensors. Results point to the inherent difficulty of decentralized decision making and suggest that optimality may be an elusive goal. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227611509>
library:oclcnum"227611509"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"16 MAR 1984"
schema:datePublished"1984"
schema:description"The authors study the computational complexity of the discrete versions of some simple but basic decentralized decision problems. These problems are variations of the classical 'team decision problem' and include the problem of decentralized detection, whereby a central processor is to select one of two hypotheses, based on 1-bit messages from two non-communicating sensors. Results point to the inherent difficulty of decentralized decision making and suggest that optimality may be an elusive goal. (Author)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/766904897>
schema:inLanguage"en"
schema:name"On the Complexity of Decentralized Decision Making and Detection Problems."@en
schema:numberOfPages"32"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.