Skip to main content



Eva Tardos

et28-profile.jpg
  • Eva Tardos
  • Dept: Computer Science
  • Title: Jacob Gould Schurman Professor
  • Address: 316 Gates Hall
  • Phone: 607 255-0984
  • return to list

Biography

Eva Tardos received her Dipl.Math. in 1981 , and her Ph.D. 1984, from Eötvös University , Budapest, Hungary . She joined Cornell in 1989, and was Chair of the Department of Computer Science 2006-2010. She has been elected to the National Academy of Engineering, National Academy of Sciences, and the American Academy of Arts and Sciences, is an external member of the Hungarian Academy of Sciences, and is the recipient of a number of fellowships and awards including the Packard Fellowship, the Gödel Prize, Dantzig Prize, Fulkerson Prize, and the IEEE Technical Achievement Award.  She was editor editor-in-Chief of SIAM Journal of Computing 2004-2009, and is currently editor of several other journals including the Journal of the ACM, Theory of Computing, and Combinatorica.

Tardos's research interest is algorithms and algorithmic game theory, an area concerned with designing and analyzing systems and algorithms for selfish users. Her research focuses on algorithms and games on networks.  She is most known for her work on network-flow algorithms, approximation algorithms, and quantifying the efficiency of selfish routing.

 

Selected Publications

  • Roughgarden, T., Eva Tardos. 2002. "How bad is selfish routing?." Journal of the Acm 49 (2): 236-259.
  • Kempe, David, Jon Kleinberg, Eva Tardos. 2003. "Maximizing the spread of influence through a social network." Paper presented at the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
  • Anshelevich, E., A. Dasgupta, J. Kleinberg, Eva Tardos, T. Wexler, T. Roughgarden. 2008. "The Price of Stability for Network Design with Fair Cost Allocation." Siam Journal on Computing 38 (4): 1602-1623.
  • Kleinberg, J., Eva Tardos. 2002. "Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields." Journal of the ACM 49 (5): 616-639.
  • Tardos, Eva. 1985. "A Strongly Polynomial Minimum Cost Circulation Algorithm." Combinatorica 5 (3): 247-255.

Selected Awards and Honors

  • Van Wijngaarden Award (CWI, Netherlands) 2011
  • Member (National Academy of Engineering) 2007
  • Dantzig Prize 2006
  • Fellow (American Academy of Arts and Sciences) 2001
  • Recipient, Packard Fellowship

Websites

Education

  • Ph D (Mathematics), Eotvos Lorand University, 1984