Éva Tardos

35.3k citations

155 papers · 18.5k indexed · 10 hit papers · h-index 55

Impact in

Management Science and Operations Research top 0.02%
- Game Theory and Applications
- Auction Theory and Applications
Statistical and Nonlinear Physics top 0.05%
- Complex Network Analysis Techniques
- Opinion Dynamics and Social Influence

Papers in

Management Science and Operations Research 62
- Game Theory and Applications 41
- Auction Theory and Applications 37
- Advanced Bandit Algorithms Research 14
Computational Theory and Mathematics 59
- Complexity and Algorithms in Graphs 52
- Advanced Graph Theory Research 35

Co-authors: Jon Kleinberg David Kempe Tim Roughgarden David B. Shmoys Vijay V. Vazirani Noam Nisan Serge Plotkin Aaron Archer
Journals: Mathematics of Operations Research (6 papers)SIAM Journal on Computing (5 papers)Mathematical Programming (5 papers)Journal of Computer and System Sciences (4 papers)Journal of the ACM (4 papers)
Partner nations: United States Hungary Israel

In The Last Decade

Éva Tardos

150 papers receiving 17.5k citations

Hit Papers

10 papers align trajectories log scale

2015 · 294 citations

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if any of the following hold:

it has ≥500 total citations;
it reaches ≥1.5× the top-1% citation threshold for papers in the same subfield and year (the threshold is the minimum needed to enter the top 1%, not the average within it);
it reaches the top citation threshold in at least one of its specific research topics.

2015 Theory of Computing
2007 Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria
2007 Cambridge University Press eBooks
2007 Algorithmic Game Theory: Computing in Games
2005 Algorithm Design
2003 Maximizing the spread of influence through a social network
2003 Maximizing the spread of influence through a social network
2002 Journal of the ACM
1993 Mathematical Programming
1990 Mathematical Programming

Peers

Countries citing papers authored by Éva Tardos

Since Specialization

Citations

This map shows the geographic impact of Éva Tardos's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Éva Tardos with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Éva Tardos more than expected).

Fields of papers citing papers by Éva Tardos

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Éva Tardos. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Éva Tardos. The network helps show where Éva Tardos may publish in the future.

Co-authors

The 25 scholars most cited alongside Éva Tardos, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Éva Tardos Line = papers co-authored together Éva Tardos links everyone, so they are left out of the graph.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work
1	Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions R. C. Lathrop, Éva Tardos	2023	1
2	Learning in Games: Robustness of Fast Convergence Neural Information Processing Systems ·Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos	2016	3
3	No-Regret Learning in Repeated Bayesian Games. arXiv (Cornell University) ·Jason D. Hartline, Vasilis Syrgkanis, Éva Tardos	2015	1
4	Theory of Computing ·David Kempe, Jon Kleinberg, Éva Tardos Hit paper breakdown →	2015	294
5	On the efficiency of equilibria in generalized second price auctions arXiv (Cornell University) ·Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos	2012	29
6	Beyond the Nash Equilibrium Barrier. Robert Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos	2011	21
7	Theory of Computing ·Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler	2008	63
8	Computational Social Systems and the Internet Data Archiving and Networked Services (DANS) ·Peter Cramton, 林远明, Éva Tardos, Moshe Tennenholtz	2007	5
9	Algorithmic Game Theory Cambridge University Press eBooks ·Noam Nisan, Christos H. Papadimitriou, Éva Tardos, Bernhard von Stengel, Avrim Blum, Vijay V. Vazirani, Bruno Codenotti, Michael Kearns, Yevgeniy Dodis, James Schummer, Liad Blumrosen, Ron Lavi, Jason D. Hartline, Joan Feigenbaum, Kamal Jain, David C. Parkes, Tim Roughgarden, Berthold Vöcking, Ramesh Johari Hit paper breakdown →	2007	1422
10	Facility location with hierarchical facility costs Symposium on Discrete Algorithms ·Zoya Svitkina, Éva Tardos	2006	8
11	Network design for information networks Symposium on Discrete Algorithms ·Hercules Kuster, Chaitanya Swamy, Éva Tardos	2005	37
12	Approximate classification via earthmover metrics Symposium on Discrete Algorithms ·Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos	2004	16
13	A stronger bound on Braess's Paradox Symposium on Discrete Algorithms ·Henry Lin, Tim Roughgarden, Éva Tardos	2004	13
14	An approximate truthful mechanism for combinatorial auctions with single parameter agents Symposium on Discrete Algorithms ·Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos	2003	75
15	A Constant-Factor Approximation Algorithm for the k-Median Problem Journal of Computer and System Sciences ·Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys	2002	268
16	The quickest transshipment problem Symposium on Discrete Algorithms ·Bruce Hoppe, Éva Tardos	1995	46
17	Improved approximation algorithms for network design problems Symposium on Discrete Algorithms ·M. X. Goemans, Andrew V. Goldberg, Serge Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson	1994	99
18	Scheduling unrelated machines with costs Symposium on Discrete Algorithms ·David B. Shmoys, Éva Tardos	1993	37
19	Improved dual network simplex Symposium on Discrete Algorithms ·Serge Plotkin, Éva Tardos	1990	16
20	Using separation algorithms in fixed dimension Symposium on Discrete Algorithms ·G. Bernet, Serge Plotkin, Éva Tardos	1990	10

About Éva Tardos

Éva Tardos is a scholar working on Management Science and Operations Research, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Marketing and Computer Networks and Communications, having authored 155 papers that have together received 18.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (52 papers), Game Theory and Applications (41 papers), Optimization and Search Problems (40 papers), Auction Theory and Applications (37 papers), Advanced Graph Theory Research (35 papers), Consumer Market Behavior and Pricing (18 papers), Game Theory and Voting Systems (18 papers) and Advanced Bandit Algorithms Research (14 papers). The work is most often cited by research in Management Science and Operations Research (5.5k citations), Statistical and Nonlinear Physics (4.9k citations), Computer Networks and Communications (6.5k citations), Computational Theory and Mathematics (3.1k citations) and Transportation (1.2k citations). Éva Tardos has collaborated with scholars based in United States, Hungary and Israel. Frequent co-authors include Jon Kleinberg, David Kempe, Tim Roughgarden, David B. Shmoys, Vijay V. Vazirani, Noam Nisan, Serge Plotkin, Aaron Archer, Karen Aardal and Jan Karel Lenstra. Their work appears in journals such as Mathematics of Operations Research, SIAM Journal on Computing, Mathematical Programming, Journal of Computer and System Sciences and Journal of the ACM.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact