skip to main content
Guest
My Research
My Account
Sign out
Sign in
This feature requires javascript
Library Search
Find Databases
Browse Search
E-Journals A-Z
E-Books A-Z
Citation Linker
Help
Language:
English
Vietnamese
This feature required javascript
This feature requires javascript
Primo Advanced Search
All Library Resources
All
Course Materials
Course Materials
Primo Advanced Search Query Term
Input search text:
Show Results with:
criteria input
contains
is (exact)
starts with
Show Results with:
criteria input
Any
in the title
as author/creator
in subject
Full Text
ISBN
ISSN
TOC
Keyword
Field
Show Results with:
in the title
Show Results with:
Any
in the title
as author/creator
in subject
Full Text
ISBN
ISSN
TOC
Keyword
Field
Primo Advanced Search prefilters
Material Type:
criteria input
All items
Books
Articles
Images
Audio Visual
Maps
Graduate theses
Search Scope:
All Library Resources
Print Resources
Digital Resources
Online E-Resources
Simple Search
This feature requires javascript
The Value of Information in Distributed Decision Networks
Approved For Public Release
Digital Resources/Online E-Resources
View Online
Details
Recommendations
Reviews
External Links
This feature requires javascript
Actions
Add to My Research
Remove from My Research
E-mail
Print
Permalink
Citation
EasyBib
EndNote
RefWorks
Delicious
Export RIS
Export BibTeX
This feature requires javascript
Title:
The Value of Information in Distributed Decision Networks
Author:
Munther,Dahleh
Subjects:
algorithms
;
differential equations
;
distributed decision networks
;
MATHEMATICAL MODELS
;
Numerical Mathematics
;
probability distributions
;
random
variables
;
theorems
Description:
We now define a mathematical framework for networks. Let G = (V,E) be an undirected random network (graph) drawn from a known distribution pG,1 composed of a finite vertex set V and a link set E = { V x V modulo S} where S = {{(i; j); (j; i)}}. Each vertex i isin V corresponds to an agent, and each link (j; i) isin E corresponds to a channel by which information flows from agent j to agent i in the network. We denote the neighborhood of I by N(i) = {j vertical line (i; j) isin E}.There is a state (internal or external) W drawn from a distribution pW that the agents may want to estimate, transmit, and act upon. Each agent i also possesses a state and some private observation about W. We denote the state at time t by xi(t), and we assume that the tuple of initial states (xi(0)) is correlated with W and are drawn randomly from a joint distribution pWX0 . Agent i's private information/observation at time t is denoted by Yi(t) and has a joint distribution pWYi(t) with W. Finally, agent i has some information about agent j's state (either because it can observe it or agent j transmits it), which we denote by mji(t) = mji(xj(t)).
Creation Date:
2016
Language:
English
Source:
DTIC Technical Reports
This feature requires javascript
This feature requires javascript
Back to results list
Previous
Result
6
Next
This feature requires javascript
This feature requires javascript
Searching Remote Databases, Please Wait
Searching for
in
scope:(TDTS)
Show me what you have so far
This feature requires javascript
This feature requires javascript