Oliver Friedmann is a German computer scientist and mathematician known for his work on

parity game A parity game is played on a colored directed graph, where each node has been colored by a priority – one of (usually) finitely many natural numbers. Two players, 0 and 1, move a (single, shared) token along the edges of the graph. The owne ...

s and the

simplex algorithm In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are n ...

. Friedmann earned his doctorate's degree from the

Ludwig Maximilian University of Munich The Ludwig Maximilian University of Munich (simply University of Munich or LMU; german: Ludwig-Maximilians-Universität München) is a public research university in Munich, Germany. It is Germany's sixth-oldest university in continuous operatio ...

in 2011 under the supervision of Martin Hofmann and Martin Lange.

Awards

He won the Kleene Award for showing that state-of-the-art policy iteration algorithms for

s require exponential time in the worst case. He and his coauthors extended the proof techniques to the

and to policy iteration for Markov decision processes. His seminal body of work on lower bounds in convex optimization, leading to a sub-exponential lower bound for Zadeh's rule, was awarded with the

Tucker Prize The Tucker Prize for outstanding theses in the area of optimization is sponsored by the Mathematical Optimization Society The Mathematical Optimization Society (MOS), known as the Mathematical Programming Society until 2010,"Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs"
(Mathematical Optimization Society)

References

{{DEFAULTSORT:Friedmann, Oliver Chief technology officers German computer scientists Ludwig Maximilian University of Munich alumni Living people Year of birth missing (living people)