Abstract:
We introduce the notion of update networks to model communication networks
with infinite duration.In our formalization we use bipartite finite graphs and
game-theoretic terminology as an underlying structure.F or these networks we exhibit a
simple routing procedure to update information throughout the nodes of the network.
We also introduce an hierarchy for the class of all update networks and discuss the
complexity of some natural problems.