skip to content
On the Complexity of Distributed Decision Problems. Preview this item
ClosePreview this item
Checking...

On the Complexity of Distributed Decision Problems.

Author: J Tsitsiklis; M Athans; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
Publisher: Ft. Belvoir Defense Technical Information Center NOV 1983.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
This document studies the computational complexity of finite versions of the simplest and fundamental problems of distributed decision making and it is shown that, apart from a few exceptions, such problems are hard (NP-complete, or worse). Some of the problems studied are the well-known team decision problem, the distributed hypothesis testing problem, as well as the problem of designing a communications protocol  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 Tsitsiklis; M Athans; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
OCLC Number: 227605169
Description: 6 p.

Abstract:

This document studies the computational complexity of finite versions of the simplest and fundamental problems of distributed decision making and it is shown that, apart from a few exceptions, such problems are hard (NP-complete, or worse). Some of the problems studied are the well-known team decision problem, the distributed hypothesis testing problem, as well as the problem of designing a communications protocol that guarantees the attainment of a prespecified goal with as little communications as possible. These results indicate the inherent difficulty of distributed decision making, even for very simple problems, with trivial centralized counterparts and suggest that optimality may be an elusive goal of distributed systems.

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/227605169>
library:oclcnum"227605169"
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:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"NOV 1983"
schema:datePublished"1983"
schema:description"This document studies the computational complexity of finite versions of the simplest and fundamental problems of distributed decision making and it is shown that, apart from a few exceptions, such problems are hard (NP-complete, or worse). Some of the problems studied are the well-known team decision problem, the distributed hypothesis testing problem, as well as the problem of designing a communications protocol that guarantees the attainment of a prespecified goal with as little communications as possible. These results indicate the inherent difficulty of distributed decision making, even for very simple problems, with trivial centralized counterparts and suggest that optimality may be an elusive goal of distributed systems."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1909062680>
schema:inLanguage"en"
schema:name"On the Complexity of Distributed Decision Problems."@en
schema:numberOfPages"6"
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.