b. 1946
Nimrod Megiddo is an Israeli-American mathematician and computer scientist whose work spans game theory, combinatorial optimization, and linear programming. He is known for foundational contributions to the theory of sequential games, including extensions of equilibrium refinements and the interpretation of plausibility in extensive-form games, as well as influential algorithms in linear-time optimization.
Developed linear-time algorithms for linear programming in fixed dimension
Contributed to the theory of sequential equilibrium and plausibility in extensive-form games
Advanced parametric and combinatorial optimization techniques
Research Staff Member at IBM Almaden Research Center
Co-authored influential work on the computational complexity of equilibria