Information Flow on Directed Acyclic Graphs

DOI10.1007/978-3-642-20920-8_13zbMath1326.68208OpenAlexW1599382182MaRDI QIDQ3003351

Michael S. Donders, Sara Miner More, Pavel Naumov

Publication date: 27 May 2011

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20920-8_13

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Network protocols (68M12)

Related Items (6)

Fault Tolerance in Belief Formation Networks ⋮ Independence in information spaces ⋮ Symmetry in information flow ⋮ On interchangeability of Nash equilibria in multi-player strategic games ⋮ The Ryōan-ji axiom for common knowledge on hypergraphs ⋮ Game Semantics for the Geiger-Paz-Pearl Axioms of Independence

This page was built for publication: Information Flow on Directed Acyclic Graphs