Talked to Dinitz when I ran into him at weekly Tea in GHC about his summer research on --- convenient coincidence --- network routing algorithms. He had some neat complexity results about an idealized version of interior BGP. There's a problem that looks like it should be as bad as Σ2 because of the way it universally quantifies over all possible subsets of your routers that might have the best external route, but actually because routes live in a metric space, for some reason the set of classes of different subsets is only linear in the number of routers not the full powerset, so it's just NP after all.
Put in an application for an apartment in philly.
Went to dinner with tom7.