description Eva Tardos Overview
Éva Tardos is a Hungarian-American computer scientist at Cornell University, where she is the Jacob Gould Schurman Professor of Computer Science. Her research centers on algorithms, particularly approximation algorithms for network and scheduling problems, and on algorithmic game theory, where she studies the efficiency of selfish outcomes in games. With Jon Kleinberg she co-authored 'Algorithm Design,' a widely used undergraduate and graduate text. She is a member of the National Academy of Engineering.
help Eva Tardos FAQ
What is Éva Tardos's most famous contribution to algorithmic game theory?
Tardos is known for her work with Tim Roughgarden on bounding the 'price of anarchy' in selfish routing games, showing that in certain network settings, unregulated user behavior can be nearly as efficient as optimal centralized routing. This work became foundational for algorithmic game theory as a field.
What algorithms textbook did Éva Tardos co-author?
Tardos co-authored 'Algorithm Design' with Jon Kleinberg, published in 2005. The textbook is widely adopted in undergraduate and graduate algorithms courses and is known for its clear explanations and real-world motivated problem sets.
Where does Éva Tardos work and what is her title?
Tardos is the Jacob Gould Schurman Professor of Computer Science at Cornell University. She has been at Cornell for most of her academic career and served as chair of the Computer Science Department.
How did Éva Tardos contribute to approximation algorithms?
Tardos made significant early contributions to approximation algorithms for network design, packing, and covering problems. Her work on strongly polynomial algorithms for combinatorial optimization, including fractional packing and covering frameworks, became important tools in algorithm design.
explore Explore More
Reviews & Comments
Write a Review
Be the first to review
Share your thoughts with the community and help others make better decisions.
