Eva Tardos received her Dipl.Math. in 1981, and her Ph.D. 1984, from Eötvös University, Budapest, Hungary. She was Chair of the Department of Computer Science at Cornell University 2006-2010. 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.
- 2010. "Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction." Paper presented at Annual IEEE Symposium on Foundations of Computeer Science, November. .
- 2013. "Network formation in the presence of contagious risk." ACM Transactions on Economics and Computation . .
- 2013. "On the Composability of Efficient Mechanisms." Paper presented at Proceedings of the Symposium of Theory of Computing .
- 2013. "Bayesian Sequential Auction." ACM Transactions of Economics and Computation. . .
- 2012. "The Dining Bidder Problem: a la russe et a la francaise." Paper presented at SIGecom Exchange, December. .
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
- Ph D (Mathematics), Eotvos Lorand University, 1984