Oliver Friedmann
Oliver Friedmann | |
|---|---|
| Nationality | German |
| Education | Ludwig Maximilian University of Munich (Diploma and Doctorate) |
| Occupation(s) | CTO, Computer scientist |
| Known for | Lower bounds on Parity game algorithms |
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.[2]
Awards[edit]
He won the Kleene Award[3] for showing that state-of-the-art policy iteration algorithms for parity games require exponential time in the worst case.[4] He and his coauthors extended the proof techniques to the simplex algorithm and to policy iteration for Markov decision processes.[5] His seminal body of work on lower bounds in convex optimization, leading to a sub-exponential lower bound[6] for Zadeh's rule, was awarded with the Tucker Prize.[7]
References[edit]
- ^ "Heinz Schwärtzel Dissertation Award" (in German). Archived from the original on 2018-08-16. Retrieved 2018-03-14.
- ^ Oliver Friedmann at the Mathematics Genealogy Project
- ^ "Kleene Award Winners". Retrieved 2018-03-14.
- ^ "An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it". Retrieved 2018-03-14.
- ^ "STOC Best Paper Award". Archived from the original on 2017-12-22. Retrieved 2018-03-14.
- ^ "Günter Ziegler: 1000$ from Beverly Hills for a Math Problem". 20 January 2011. Retrieved 2018-03-14.
- ^ "Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs" (Mathematical Optimization Society)
