DMCA
Protecting Privacy through Distributed Computation in Multi-agent Decision Making Online Appendix 2: DFS Tree Generation Algorithm
Cached
Download Links
| Citations: | 1 - 0 self |
BibTeX
@MISC{Léauté_protectingprivacy,
author = {Thomas Léauté and Boi Faltings},
title = {Protecting Privacy through Distributed Computation in Multi-agent Decision Making Online Appendix 2: DFS Tree Generation Algorithm},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
1: if x has at least one neighbor then 2: if x is the root then 3: openx ← all neighbors of x 4: Remove a random neighbor y0 from openx and add it to childrenx 5: Send a CHILD message to y0 6: loop 7: Wait for an incoming message of type type from a neighbor yi 8: if openx = ∅ then / / first time x is visited 9: openx ← all neighbors of x except yi 10: parentx ← yi 11: else if type = CHILD and yi ∈ openx then 12: Remove yi from openx and add it to pseudo childrenx 13: Send PSEUDO message to yi 14: next 15: else if type = PSEUDO then
