In 1967, Witsenhausen formulated a seemingly simple problem to demonstrate that distributed control problems can be hard. That problem, now infamously called Witsenhausen's counterexample, is still unsolved. In 1986, Papadimitrou and Tsitsiklis showed that finding the optimal control law for the discrete version of the problem is NP-complete. Faced with this conclusion, the research community has...