Gabriel M. de Azevedo

I’m a second-year PhD student at the School of Operations Research and Information Engineering at Cornell, where I am fortunate to be advised by Paul Gölz. My recent work addresses the problem of selecting citizens’ assemblies while maximizing randomness. I am broadly interested in social choice problems and combinatorial optimization.

Previously, I completed my undergrad in Molecular Sciences and my master’s in Computer Science at the University of São Paulo. During my master’s, I was advised by Yoshiko Wakabayashi. Also, I spent a semester at the University of Waterloo working with Joseph Cheriyan on approximation algorithms for the 2-edge-connected spanning subgraph problem.