Éva Tardos

Éva Tardos is a renowned Hungarian-American computer scientist and mathematician known for her work in algorithm design, game theory, and optimization theory, closely collaborating with Daniel Spielman and Shang-Hua Teng. Her research has been influenced by the works of Christos Papadimitriou and Noam Nisan, and she has made significant contributions to the field of computer science, particularly in the areas of approximation algorithms and online algorithms, as recognized by the Association for Computing Machinery and the Society for Industrial and Applied Mathematics. Tardos has also been affiliated with Microsoft Research and Stanford University, and has worked alongside prominent researchers such as Jon Kleinberg and Éva Jablonka. Her work has been published in top-tier conferences and journals, including STOC, FOCS, and Journal of the ACM, and has been supported by grants from the National Science Foundation and the Alfred P. Sloan Foundation.

● Early Life and Education

Éva Tardos was born in Budapest, Hungary, and grew up in a family of mathematicians and scientists, including her father, Gábor Tardos, a notable mathematician and computer scientist. She developed an interest in mathematics and computer science at a young age, inspired by the works of Alan Turing and Emmy Noether, and pursued her undergraduate studies at Eötvös Loránd University, where she was influenced by the teachings of László Lovász and György Elekes. Tardos then moved to the United States to pursue her graduate studies at Cornell University, where she earned her Ph.D. in computer science under the supervision of Robert Tarjan and Juris Hartmanis, and was also influenced by the research of Michael Sipser and Leslie Valiant. During her time at Cornell, she was exposed to the works of Richard Karp and Turing Award winners such as Donald Knuth and Edsger W. Dijkstra.

● Career

Tardos began her academic career as a research scientist at Microsoft Research, where she worked alongside prominent researchers such as Jennifer Chayes and Christian Borgs, and collaborated with Yahoo! Research and Google Research. She later joined the faculty at Cornell University as a professor of computer science, where she has taught courses on algorithm design and game theory, and has supervised students such as Tim Roughgarden and Vasilis Syrgkanis. Tardos has also held visiting positions at Stanford University and Massachusetts Institute of Technology, and has collaborated with researchers such as Silvio Micali and Shafi Goldwasser, and has been involved in the organization of conferences such as STOC and FOCS, and has served on the editorial boards of journals such as Journal of the ACM and SIAM Journal on Computing.

● Research and Contributions

Tardos's research focuses on the design and analysis of algorithms for solving complex optimization problems, particularly in the areas of approximation algorithms and online algorithms, as well as game theory and mechanism design, building on the works of John Nash and Roger Myerson. She has made significant contributions to the field of computer science, including the development of approximation algorithms for NP-hard problems such as the traveling salesman problem and the knapsack problem, and has collaborated with researchers such as Sanjeev Arora and Subhash Khot. Tardos's work has also been influenced by the research of Christos Papadimitriou and Mihalis Yannakakis, and she has been recognized for her contributions to the field of algorithmic game theory, including the study of Nash equilibria and Pareto optimality, and has been supported by grants from the National Science Foundation and the Alfred P. Sloan Foundation.

● Awards and Honors

Tardos has received numerous awards and honors for her contributions to computer science, including the Gödel Prize and the Fulkerson Prize, and has been elected as a fellow of the Association for Computing Machinery and a fellow of the Society for Industrial and Applied Mathematics. She has also been recognized as one of the most influential scientists in the world by Thomson Reuters, and has been awarded the National Science Foundation's Career Award and the Alfred P. Sloan Foundation's Research Fellowship, and has been honored by the Hungarian Academy of Sciences and the American Academy of Arts and Sciences.

● Selected Publications

Tardos has published numerous papers in top-tier conferences and journals, including STOC, FOCS, and Journal of the ACM, and has co-authored papers with prominent researchers such as Daniel Spielman and Shang-Hua Teng. Some of her notable publications include "A Simple and Efficient Algorithm for Finding a Maximum Weight Perfect Matching in a General Graph" and "The Price of Anarchy is Independent of the Network Topology", and has also published papers in journals such as SIAM Journal on Computing and Operations Research, and has been cited by researchers such as Tim Roughgarden and Vasilis Syrgkanis. Her work has been supported by grants from the National Science Foundation and the Alfred P. Sloan Foundation, and has been recognized by the Association for Computing Machinery and the Society for Industrial and Applied Mathematics. Category:Computer scientists