skip to content
Problems in Decentralized Decision making and Computation. Preview this item
ClosePreview this item
Checking...

Problems in Decentralized Decision making and Computation.

Author: J N Tsitsiklis; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
Publisher: Ft. Belvoir Defense Technical Information Center DEC 1984.
Edition/Format:   Book : English
Database:WorldCat
Summary:
This thesis investigates certain fundamental problems in decentralized decision making and computation. We study the problem of whether a set of decision makers (or processors) with different (but related) information may make compatible decisions without communication and we characterize the computational complexity of this problem. We also analyze the complexity of other basic problems of decentralized decision  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; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
OCLC Number: 227635244
Description: 272 p.

Abstract:

This thesis investigates certain fundamental problems in decentralized decision making and computation. We study the problem of whether a set of decision makers (or processors) with different (but related) information may make compatible decisions without communication and we characterize the computational complexity of this problem. We also analyze the complexity of other basic problems of decentralized decision making, such as decentralized detection (hypothesis testing). We then consider a scheme whereby a set of decision makers (processors) exchange and update tentative decisions which minimize a common cost function, given information they possess; we show that they are guaranteed to converge to consensus. Finally, we consider a broad class of asynchronous distributed (deterministic and stochastic) iterative optimization algorithms tolerating communication delays. We associate communication requirements with such algorithms and show that they converge appropriately under certain conditions which are no more severe than those required for their centralized counterparts. Several applications in human organizations, parallel computation and distributed signal processing are indicated. Additional keywords: decision theory. (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/227635244>
library:oclcnum"227635244"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227635244>
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:about
schema:contributor
schema:contributor
schema:datePublished"DEC 1984"
schema:datePublished"1984"
schema:description"This thesis investigates certain fundamental problems in decentralized decision making and computation. We study the problem of whether a set of decision makers (or processors) with different (but related) information may make compatible decisions without communication and we characterize the computational complexity of this problem. We also analyze the complexity of other basic problems of decentralized decision making, such as decentralized detection (hypothesis testing). We then consider a scheme whereby a set of decision makers (processors) exchange and update tentative decisions which minimize a common cost function, given information they possess; we show that they are guaranteed to converge to consensus. Finally, we consider a broad class of asynchronous distributed (deterministic and stochastic) iterative optimization algorithms tolerating communication delays. We associate communication requirements with such algorithms and show that they converge appropriately under certain conditions which are no more severe than those required for their centralized counterparts. Several applications in human organizations, parallel computation and distributed signal processing are indicated. Additional keywords: decision theory. (Author)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1862878758>
schema:inLanguage"en"
schema:name"Problems in Decentralized Decision making and Computation."@en
schema:numberOfPages"272"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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