Éva Tardos is the Jacob Gould Schurman Professor of Computer Science. Her research interests include algorithms and algorithmic game theory, the subarea of theoretical computer science theory of designing and analyzing systems, and algorithms for selfish users. Her research focuses on algorithms and games on networks and simple auctions. She is most known for her work on quantifying the efficiency of selfish routing. Tardos received her Dipl.Math. and Ph.D. from Eötvös University, in Hungary. She has been elected to the National Academy of Engineering, the National Academy of Sciences, the American Philosophical Society, the American Academy of Arts and Sciences. She is the recipient of a number of fellowships and awards including the Packard Fellowship and the IEEE von Neumann Medal.