Éva Tardos

Éva Tardos ( born 1957 ) is a Hungarian mathematician and a computer scientist.


Tardos studied at the Eotvos Lorand University in Budapest, where she made ​​her diploma in 1981 and earned his doctorate under András Frank 1984. After that, she was a Humboldt Fellow at the University of Bonn and at MSRI. 1986/7 she was a scholarship from the Hungarian Academy of Sciences at Eotvos Lorand University and after two years a visiting professor at the Massachusetts Institute of Technology. Since 1989 she is a professor at Cornell University.

It deals with algorithms, complexity theory, games in networks and graphs ( Algorithmic game theory with applications to systems and algorithms for selfish users), network theory ( pathfinding packages, design, flow algorithms, theory of social networks), and general combinatorial optimization problems in networks and graphs, scheduling.

In 1988, she won the Fulkerson Prize ( for A 'strongly polynomial minimum cost circulation algorithm, Combinatorica, Volume 5, 1985, pp. 247-256 ). 1991-1993 she was Sloan Fellow, 1990-1995 Packard Fellow, 1999-2000 Guggenheim Fellow and Presidential Young Investigator 1991-1996 National Science Foundation. She was invited speaker at the ICM 1990 in Kyoto ( Strongly Polynomial and Combinatorial Algorithms in Optimization). She is a member of the American Academy of Arts and Sciences, the National Academy of Engineering and a Fellow of the Association for Computing Machinery. In 2006 she received the George B. Dantzig Prize - 2012 and the Gödel Prize for their work How bad is selfish routing? Tim Roughgarden. In 2013 she received the Technical Achievement Award from the IEEE Computer Society for her work on algorithmic game theory, and especially selfish routing. She is a Fellow of the American Mathematical Society.

2003 to 2009 she was editor of the SIAM J. Computing. She is co-editor of the Journal of the ACM and of Combinatorica.

She is the sister of Gábor Tardos.


  • Jon Kleinberg: Algorithm Design. Addison Wesley, 2005
  • Noam Nisan with Vijay Vazirani, Tim Roughgarden (Editor): Algorithmic Game Theory. Cambridge University Press, 2007 ( in it with Vazirani: Basic solution concepts and computational issues in games, with Roughgarden: Introduction to the inefficiency of equilibria, with Tom Wexler: Network formation games)
  • AV Goldberg, Robert Tarjan: Network Flow Algorithms. In: Bernhard Korte, László Lovász, HJ Prömel, A. Schrijver (Editor): Paths, Flows and VLSI design. Springer Verlag, 1990, pp. 101-164.
  • With DB Shmoys: Computational complexity, as well as with Shmoys, Lovasz Combinatorics in Computer Science. In: Ronald Graham, Martin Groetschel, Lovasz: Handbook of Combinatorics. North Holland