Oliver Friedmann Explained

Oliver Friedmann is a German computer scientist and mathematician known for his work on parity games and the simplex algorithm.^[1]

Friedmann earned his doctorate's degree from the Ludwig Maximilian University of Munich in 2011 under the supervision of Martin Hofmann and Martin Lange.

Awards

He won the Kleene Award^[2] for showing that state-of-the-art policy iteration algorithms for parity games require exponential time in the worst case.^[3] He and his coauthors extended the proof techniques to the simplex algorithm and to policy iteration for Markov decision processes.^[4] His seminal body of work on lower bounds in convex optimization, leading to a sub-exponential lower bound^[5] for Zadeh's rule, was awarded with the Tucker Prize.^[6]

Notes and References

1. Web site: Heinz Schwärtzel Dissertation Award. de. 2018-03-14. https://web.archive.org/web/20180816230556/https://www.in.tum.de/news-single-view/?tx_ttnews%5Btt_news%5D=60&cHash=4e4d9145d784a3e4cb8fed1c5015308b. 2018-08-16. dead.
2. Web site: Kleene Award Winners. en. 2018-03-14.
3. Web site: An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. en. 2018-03-14.
4. Web site: STOC Best Paper Award. en. 2018-03-14. https://web.archive.org/web/20171222105103/http://www.sigact.org/Prizes/BestPaper/. 2017-12-22. dead.
5. Web site: Günter Ziegler: 1000$ from Beverly Hills for a Math Problem.. 20 January 2011 . en. 2018-03-14.
6. http://www.mathopt.org/?nav=tucker_2012 "Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs"