|Éva Tardos is a Jacob Gould Schurman Professor of Computer Science at Cornell University, where she was department chair 2006–10. She received her BA and PhD from Eötvös University in Budapest. She had a Humboldt Fellowship at the University of Bonn, a postdoctoral fellowship at the Mathematical Sciences Research Institute in Berkeley, and a postdoctoral fellowship at the Hungarian Academy of Sciences at Eötvös University. After two years as a visiting professor at the Massachusetts Institute of Technology, Tardos joined the faculty at Cornell in 1989.
Tardos’s research interests are algorithms and algorithmic game theory, the subarea of theoretical computer science theory of designing systems and algorithms for selfish users. Her research focuses on algorithms and games on networks. She is best known for her work on network-flow algorithms, approximation algorithms, and quantifying the efficiency of selfish routing.
She has been elected to the National Academy of Engineering, National Academy of Sciences, and the American Academy of Arts and Sciences, and is the recipient of several fellowships and awards, including the Packard Fellowship, the Fulkerson Prize, the Dantzig Prize, and the Goedel Prize. She is editor-in-chief of the Journal of the ACM, was earlier editor-in-chief of SIAM Journal of Computing (2003–09), and is editor of several other journals, including Combinatorica.
For additional information see: