Bento Natura’s research is primarily centered on algorithms, optimization, and game theory, with a specialized emphasis on the theory of linear programming. He is particularly interested in exploring the application of continuous methods, especially in convex optimization, to solve combinatorial problems that model a wide range of practical challenges.
Natura has held postdoctoral research positions at Georgia Tech, Brown University, and UC Berkeley. He earned his PhD in Mathematics from the London School of Economics in 2022. Prior to his doctoral studies, he obtained both his Bachelor’s and Master’s degrees in Mathematics from the University of Bonn.
