| Aaron Roth | |
| Alma Mater: | Columbia University Carnegie Mellon University |
| Doctoral Advisor: | Avrim Blum |
| Known For: | Algorithm design |
| Website: | Aaron Roth at the University of Pennsylvania |
| Work Institution: | University of Pennsylvania |
| Prizes: | Hans Sigrist Prize (2023) Presidential Early Career Award for Scientists and Engineers (2016) Sloan Research Fellowship (2015) NSF Career Award (2013) |
| Field: | Computer theory |
| Father: | Alvin E. Roth |
Aaron Roth is an American computer scientist. He is the Henry Salvatori Professor of Computer and Cognitive Science at the University of Pennsylvania.[1]
Roth is the son of Alvin E. Roth, a former Harvard University professor who won the Nobel Memorial Prize in Economic Sciences in 2012.[2] He earned his bachelor's degree in computer science from Columbia University in 2006,[3] and his PhD from Carnegie Mellon University under the supervision of Avrim Blum.
Roth spent a year as a postdoc at Microsoft Research New England before joining the University of Pennsylvania faculty in 2011 as the Raj and Neera Singh Assistant Professor of Computer Science and was made Class of 1940 Bicentennial Term Associate Professor in 2017.[4]
Roth's research interests include algorithm design, algorithmic fairness, differential privacy, and algorithmic game theory.[5]
Roth received an NSF Career Award in 2013,[6] a Sloan Research Fellowship in 2015,[7] a Presidential Early Career Award for Scientists and Engineers in 2016.[8] and the Hans Sigrist Prize in 2023.[9] He also received a PROSE Award in the Computer and Information Sciences category for his book The Ethical Algorithm: The Science of Socially Aware Algorithm Design co-authored with Michael Kearns.[10]