Computational Complexity of IDE

In the previous chapter we saw that IDE are guaranteed to exist. However, we do not know yet how to actually compute such an IDE for a given network. In particular, the most general existence result, is highly non-constructive: It uses a fixed point theorem in an infinite dimensional vector space to construct single extension and then Zorn’s Lemma to “glue” those together to obtain an IDE for all times.