Éva Tardos
#6,844
Most Influential Person Now
Hungarian mathematician
Éva Tardos's AcademicInfluence.com Rankings
Éva Tardoscomputer-science Degrees
Computer Science
#610
World Rank
#630
Historical Rank
Theoretical Computer Science
#41
World Rank
#41
Historical Rank
Éva Tardosmathematics Degrees
Mathematics
#992
World Rank
#1710
Historical Rank
Game Theory
#10
World Rank
#12
Historical Rank
Measure Theory
#882
World Rank
#1157
Historical Rank
Download Badge
Computer Science Mathematics
Éva Tardos's Degrees
- PhD Computer Science Eötvös Loránd University
Similar Degrees You Can Earn
Why Is Éva Tardos Influential?
(Suggest an Edit or Addition)According to Wikipedia, Éva Tardos is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University. Tardos's research interest is algorithms. Her work focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory and simple auctions.
Éva Tardos's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Maximizing the spread of influence through a social network (2003) (7701)
- How bad is selfish routing? (2000) (1909)
- Algorithm design (2005) (1578)
- Influential Nodes in a Diffusion Model for Social Networks (2005) (1037)
- Approximation algorithms for scheduling unrelated parallel machines (1987) (960)
- The price of stability for network design with fair cost allocation (2004) (920)
- An approximation algorithm for the generalized assignment problem (1993) (714)
- Fast approximation algorithms for fractional packing and covering problems (1991) (677)
- A Constant-Factor Approximation Algorithm for the k-Median Problem (2002) (585)
- Approximation algorithms for facility location problems (extended abstract) (1997) (556)
- Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields (1999) (552)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs (1986) (501)
- Network games (2004) (365)
- A strongly polynomial minimum cost circulation algorithm (1985) (359)
- “The quickest transshipment problem” (1995) (349)
- Bounding the inefficiency of equilibria in nonatomic congestion games (2004) (333)
- An application of simultaneous diophantine approximation in combinatorial optimization (1987) (295)
- Near-optimal network design with selfish agents (2003) (294)
- Fast approximation algorithms for multicommodity flow problems (1991) (291)
- An approximate truthful mechanism for combinatorial auctions with single parameter agents (2003) (267)
- Improved approximation algorithms for network design problems (1994) (245)
- Fairness in routing and load balancing (1999) (237)
- Frugal path mechanisms (2002) (234)
- A constant-factor approximation algorithm for the k-median problem (extended abstract) (1999) (228)
- Truthful mechanisms for one-parameter agents (2001) (211)
- Allocating bandwidth for bursty connections (1997) (208)
- Composable and efficient mechanisms (2012) (206)
- Network Flow Algorithms (1989) (199)
- Polynomial time algorithms for some evacuation problems (1994) (196)
- Sensitivity theorems in integer linear programming (1986) (193)
- Efficient continuous-time dynamic network flow algorithms (1998) (190)
- The gap between monotone and non-monotone circuit complexity is exponential (1988) (166)
- Generalized polymatroids and submodular flows (1988) (164)
- Group strategy proof mechanisms via primal-dual algorithms (2003) (162)
- Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract (2009) (161)
- Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (1994) (151)
- Trading networks with price-setting agents (2007) (142)
- Facility location with nonuniform hard capacities (2001) (140)
- The effect of collusion in congestion games (2006) (139)
- Disjoint paths in densely embedded graphs (1995) (138)
- Network Formation in the Presence of Contagious Risk (2011) (126)
- An application of submodular flows (1989) (124)
- Balanced outcomes in social exchange networks (2008) (120)
- Combinatorial algorithms for the generalized circulation problem (1988) (119)
- Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction (2010) (114)
- Algorithmic Game Theory: Network Formation Games and the Potential Function Method (2007) (110)
- A network pricing game for selfish traffic (2005) (105)
- Strategic network formation with structural holes (2008) (101)
- Sequential auctions and externalities (2011) (100)
- Which Networks are Least Susceptible to Cascading Failures? (2011) (96)
- Approximations for the disjoint paths problem in high-diameter planar networks (1995) (95)
- On the efficiency of equilibria in generalized second price auctions (2011) (90)
- Network design for information networks (2005) (88)
- Learning in Games: Robustness of Fast Convergence (2016) (84)
- The Price of Anarchy in Auctions (2016) (82)
- On revenue in the generalized second price auction (2012) (79)
- Distributed packet switching in arbitrary networks (1996) (79)
- Algorithmic Game Theory: Introduction to the Inefficiency of Equilibria (2007) (78)
- Bounding the inefficiency of outcomes in generalized second price auctions (2012) (77)
- Cost-Sharing Mechanisms for Network Design (2007) (75)
- Scheduling unrelated machines with costs (1993) (74)
- Econometrics for Learning Agents (2015) (73)
- Algorithms for Routing around a Rectangle (1992) (73)
- Approximation Algorithms for Steiner and Directed Multicuts (1997) (71)
- Disks, balls, and walls: analysis of a combinatorial game (1989) (70)
- Learning and Efficiency in Games with Dynamic Population (2015) (63)
- Beyond the Nash Equilibrium Barrier (2011) (62)
- Combinatorics in computer science (1996) (60)
- Strategic network formation with structural holes (2008) (57)
- Simple Generalized Maximum Flow Algorithms (1998) (56)
- The curse of simultaneity (2012) (56)
- Using separation algorithms in fixed dimension (1990) (56)
- Approximate classification via earthmover metrics (2004) (56)
- Approximating the smallest k‐edge connected spanning subgraph by LP‐rounding (2005) (52)
- A constant factor approximation algorithm for a class of classification problems (2000) (52)
- Generalized maximum flow algorithms (1999) (50)
- Polynomial dual network simplex algorithms (2011) (50)
- Note on Weintraub's Minimum-Cost Circulation Algorithm (1989) (50)
- Facility location with hierarchical facility costs (2006) (47)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (1993) (47)
- Min-Max Multiway Cut (2004) (46)
- Load balancing without regret in the bulletin board model (2009) (46)
- No-Regret Learning in Bayesian Games (2015) (45)
- Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs (1993) (44)
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (2011) (41)
- Separating Maximally Violated Comb Inequalities in Planar Graphs (1996) (39)
- Approximation algorithms for facility location problems (1998) (39)
- Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities (1990) (39)
- Mechanisms for discrete optimization with rational agents (2004) (38)
- Network formation in the presence of contagious risk (2011) (38)
- Bayesian sequential auctions (2012) (38)
- Covering directed and odd cuts (1984) (37)
- A stronger bound on Braess's Paradox (2004) (34)
- Algorithms for a network design problem with crossing supermodular demands (2004) (33)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (1992) (32)
- Small-loss bounds for online learning with partial information (2017) (32)
- Algorithmic Game Theory: Basic Solution Concepts and Computational Issues (2007) (31)
- Improved dual network simplex (1990) (31)
- Adversarial Perturbations of Opinion Dynamics in Networks (2020) (28)
- Layered Augmenting Path Algorithms (1986) (28)
- An O(n2(m + n log n) log n) min-cost flow algorithm (1986) (27)
- Information Asymmetries in Common-Value Auctions with Discrete Signals (2013) (27)
- How Bad is Selfish Routing? ∗ (27)
- Scheduling data transfers in a network and the set scheduling problem (1999) (26)
- Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability (2005) (24)
- An O(n2(m + Nlog n)log n) min-cost flow algorithm (1988) (24)
- An application of simultaneous approximation in combinatorial optimization (1985) (20)
- Interior-point methods in parallel computation (1989) (20)
- Approximation Algorithms for a Directed Network Design Problem (1999) (18)
- Sponsored Search Equilibria for Conservative Bidders (2009) (18)
- Introduction to computer science and economic theory (2015) (18)
- Approximating the smallest k-edge connected spanning subgraph by LP-rounding (2009) (18)
- MATROIDS FROM CROSSING FAMILIES (1984) (17)
- Approximately maximizing efficiency and revenue in polyhedral environments (2007) (16)
- A faster parametric minimum-cut algorithm (1994) (16)
- Network Flow Algorithm (1989) (16)
- Graph regret bounds for Thompson Sampling and UCB (2019) (15)
- Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations (2017) (15)
- Globally optimal pixel labeling algorithms for tree metrics (2010) (14)
- How to tidy up your set-system? (1988) (14)
- Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows (1993) (13)
- Stability and Learning in Strategic Queuing Systems (2020) (13)
- Polarization in Geometric Opinion Dynamics (2021) (13)
- Strong Price of Anarchy and Coalitional Dynamics (2013) (13)
- An intersection theorem for supermatroids (1990) (13)
- Do Externalities Degrade GSP ’ s Efficiency ? (2012) (13)
- Strong Price of Anarchy, Utility Games and Coalitional Dynamics (2014) (12)
- Equilibrium in Combinatorial Public Projects (2013) (11)
- Proceedings of the fourteenth ACM Conference on Electronic Commerce, EC 2013, Philadelphia, PA, USA, June 16-20, 2013 (2013) (10)
- Virtues of Patience in Strategic Queuing Systems (2020) (9)
- Scheduling unrelated parallel machines with costs (1992) (9)
- Algorithms as mechanisms: the price of anarchy of relax-and-round (2015) (9)
- On fractional multicommodity flows and distance functions (1989) (9)
- Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets (2015) (9)
- Effect of selfish choices in deferred acceptance with short lists (2017) (8)
- Computing Equilibrium in Matching Markets (2017) (8)
- The dining bidder problem: à la russe et à la française (2012) (7)
- Approximation algorithms for network design problems (2002) (7)
- Algorithmic Game Theory: Preface (2007) (7)
- Primal-Dual-Based Algorithms for a Directed Network Design Problem (2005) (6)
- Approximate Pure Nash Equilibria via Lovász Local Lemma (2009) (6)
- The Effect of Collusion in Congestion Games Extended Abstract (2006) (6)
- On Braess ’ s Paradox (2008) (6)
- Mechanism with unique learnable equilibria (2014) (5)
- Simple Maximum Flow Algorithms in Lossy Networks (2008) (5)
- Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA (1996) (4)
- No-Regret Learning in Repeated Bayesian Games (2015) (4)
- Liquid Welfare guarantees for No-Regret Learning in Sequential Budgeted Auctions (2022) (3)
- Randomness and Fairness in Two-Sided Matching with Limited Interviews (2021) (3)
- An Algorithm for the Unbounded Matroid Intersection Polyhedron (1984) (3)
- Disjoint Paths in Densely Embedded Graphs (Preprint) (1995) (3)
- Can Credit Increase Revenue? (2013) (3)
- Strongly Polynomial and Combinatorial Algorithms in Optimization (1990) (3)
- Learning and Trust in Auction Markets (2017) (2)
- Improved Approximation Algorithm for oncurrent Multi-Commodity Flows (1989) (2)
- Technical perspectiveNew developments in graph partitioning (2008) (2)
- OO COMBINATORIAL ALGORITHMS FOR THE GENERALIZED CIRCULATION PROBLEM (2)
- Approximately Stationary Bandits with Knapsacks (2023) (2)
- Computational Social Systems and the Internet (2007) (2)
- A Report on the Workshop on the Economics of Cloud Computing (2017) (2)
- Approximation Algorithms and Network Games (2003) (1)
- Bayes-Nash Price of Anarchy for GSP (2010) (1)
- Ordered Submodularity and its Applications to Diversifying Recommendations (2022) (1)
- Two-sided Matching with Limited Interviews (2019) (1)
- SUFFICIENT CONDITIONS FOR SOLVABILITY OF CHANNEL ROUTING PROBLEMS. (1984) (1)
- Incentives in Resource Allocation under Dynamic Demands (2021) (1)
- Notes from the EC'13 program chairs (2013) (1)
- Fast Convergence of Common Learning Algorithms in Games (2016) (1)
- Non-approximability results for scheduling problems with minsum criteria (2007) (1)
- Invited Articles Foreword (2016) (0)
- The EATCS Award 2020 - Call for Nominations (2019) (0)
- Calibrated Recommendations for Users with Decaying Attention (2023) (0)
- 07271 Summary - Computational Social Systems and the Internet (2007) (0)
- Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
- 07471 Abstracts Collection - Equilibrium Computation (2007) (0)
- Invited Article Foreword (2017) (0)
- Invited Articles Foreword (2016) (0)
- Invited Articles Foreword (2021) (0)
- Revenue in resource allocation games and applications (2010) (0)
- Invited Articles Foreword (2020) (0)
- Invited Article Foreword (2017) (0)
- Invited Articles Foreword (2019) (0)
- Computational complexity (1996) (0)
- Quantifying Outcomes in Games (2009) (0)
- Invited Articles Foreword (2016) (0)
- Invited Article Foreword (2018) (0)
- 07271 Abstracts Collection - Computational Social Systems and the Internet (2007) (0)
- VLSI Design, Parallel Computation and Distributed Computing (1991) (0)
- Invited Article Foreword (2021) (0)
- Invited Article Foreword (2017) (0)
- Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
- Cs6840 -algorithmic Game Theory (4 Pages) March 28 -greedy Algorithm as a Mechanism (0)
- Econometrics for Learning Agents ( working paper ) (2017) (0)
- Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round (2015) (0)
- Limits of Computability (2019) (0)
- Algorithmic Issues in Network Design and in Information Access (2002) (0)
- Computational Social Systems and the Internet Dagstuhl Seminar (2007) (0)
- Special Issue on Foundations of Computer Science (2008) (0)
- Dynamic Pricing Provides Robust Equilibria in Stochastic Ride-Sharing Networks (2022) (0)
- Women's History Month (2013) (0)
- Invited Article Foreword (2017) (0)
- Invited Article Foreword (2021) (0)
- 00 CD qt INETWORK FLOW ALGORITHMS (0)
- AN 0{n 2 (m + nlogn) logn) MIN-COST FLOW ALGORITHM (1986) (0)
- Invited Articles Foreword (2016) (0)
- Session details: Session 4A (2011) (0)
- Approximation Algorithms for Some Clustering and Classification Problems (1999) (0)
- Invited Articles Foreword (2017) (0)
- Equilibrium Computation, Dagstuhl Seminar Proceedings (2008) (0)
- Issues at the Interface of Computer Science and Economics : Report on an (2009) (0)
- Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
- Invited Articles Foreword (2017) (0)
- Invited Article Foreword (2017) (0)
- ALGORITHMS FOR EDGE-DISJOINT PATHS IN A RECTANGULAR GRID AND THEIR APPLICATIONS IN LAYOUT DESIGN. (1982) (0)
- Network Games and Approximation Algorithms (2008) (0)
- Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161) (2013) (0)
- A polynomial-time algorithm for the evacuation problem (1994) (0)
- Invited Article Foreword (2018) (0)
- Invited Article Foreword (2022) (0)
- Invited Articles Foreword (2021) (0)
- Invited Article Foreword (2018) (0)
- Parallel Imaging Problem (2008) (0)
- Chapter 40 Combinatorics in Computer Science (1990) (0)
- The EATCS Award 2022 - Laudatio for Patrick Cousot (2022) (0)
- CS 4820: Limits of Computability (2018) (0)
- The EATCS Award 2022 - Call for Nominations (2021) (0)
- Today's Plenaries (2009) (0)
- Equilibrium Computation, 18.11. - 23.11.2007 (2008) (0)
- The Price of Anarchy of Strategic Queuing Systems (2023) (0)
- Editor's ForewordEditor's Foreword (1998) (0)
- Equilibrium Computation Dagstuhl Seminar (2007) (0)
- Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets (2015) (0)
- Invited Article Foreword (2018) (0)
- The EATCS Award 2021 - Call for Nominations (2020) (0)
- Invited Articles Foreword (2019) (0)
- New network decomposition theorems with applications (1994) (0)
- Robust Pseudo-Markets for Reusable Public Resources (2023) (0)
- THREE Qualifying the Inefficiency of Equilibria 439 (2007) (0)
- Invited Articles Foreword (2017) (0)
- Algorithms as mechanisms (2015) (0)
This paper list is powered by the following services:
Other Resources About Éva Tardos
What Schools Are Affiliated With Éva Tardos?
Éva Tardos is affiliated with the following schools:
