Éva Tardos received her Dipl.Math. in 1981, and her Ph.D. 1984, from Eötvös University, Budapest, Hungary. She currently is chair of the Department of Computer Science, having previously served in the same role from 2006-2010. She served as the Associate Dean of the College of Computing and Information Science from 2012 - 2014 and the CIS Associate Dean for Diversity, Equity, and Inclusion.

She has been elected to the National Academy of Engineering and the American Academy of Arts and Sciences, and is the recipient of Packard, Sloan Foundation, and Guggenheim fellowship, an ACM Fellow, INFORMS fellow; and has received the Fulkerson Prize, and the Dantzig prize. She was editor editor-in-Chief of SIAM Journal of Computing 2004-2009, and is currently editor of several other journals: Journal of the ACM, Theory of Computing, and Combinatorica.

Tardos's research interest is algorithms and algorithmic game theory. Her work focuses on the design and analysis of efficient methods for combinatorial-optimization problems on graphs or networks. She is most known for her work on network-flow algorithms, approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory, an emerging new area of designing systems and algorithms for selfish users.