Very neat! (Read the paper!) A couple of limitations: Latency functions must have a simple, known form: only unknowns are a small number of coefficients. Latency functions must be convex Heavy machinery Have to run Ellipsoid. Computationally intensive. Centralized.
Some desiderata Remove assumptions on latency functions No known parametric form Not necessarily convex Not necessarily Lipschitz Make update elementary Ideally decentralized.
Reverse engineering why it should work View the interaction as repeated play of a game between a toll player and a flow player. What game are they playing? Flow player’s strategies are feasible flows, toll player’s strategies are tolls in some bounded range What are their cost functions? How are they playing it?