D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 53 Citations 34,229 109 World Ranking 2391 National Ranking 1281

Research.com Recognitions

Awards & Achievements

2019 - IEEE John von Neumann Medal “For contributions to the field of algorithms, including foundational new methods in optimization, approximation algorithms, and algorithmic game theory.”

2013 - Fellow of the American Mathematical Society

2013 - Member of the National Academy of Sciences

2009 - SIAM Fellow For the design and analysis of graph and network algorithms.

2007 - Member of the National Academy of Engineering For contributions to the design and analysis of efficient algorithms for network problems.

2006 - Dantzig Prize, by the Society for Industrial and Applied Mathematics (SIAM) and the Mathematical Optimization Society (MOS)

2005 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

2001 - Fellow of the American Academy of Arts and Sciences

1999 - Fellow of John Simon Guggenheim Memorial Foundation

1998 - ACM Fellow For fundamental contributions in the design and analysis of algorithms, combinatorial optimization, network flows, and approximation algorithms.

1991 - Fellow of Alfred P. Sloan Foundation

Overview

What is she best known for?

The fields of study she is best known for:

  • Algorithm
  • Computer network
  • Artificial intelligence

Her primary scientific interests are in Approximation algorithm, Mathematical optimization, Algorithm, Network planning and design and Theoretical computer science. She interconnects Discrete mathematics, Social network analysis, Optimization problem and Centrality in the investigation of issues within Approximation algorithm. Éva Tardos studies Linear programming which is a part of Mathematical optimization.

Her Algorithm research includes elements of Facility location problem, Lagrangian relaxation, Polynomial and Total cost. Her Network planning and design study combines topics from a wide range of disciplines, such as Shapley value, Game theory, Technical report and Nash equilibrium. Her Theoretical computer science research integrates issues from Algorithmic game theory, Algorithm engineering, Algorithmics, Game complexity and Computational geometry.

Her most cited work include:

  • Maximizing the spread of influence through a social network (4896 citations)
  • How bad is selfish routing (1351 citations)
  • Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria (1177 citations)

What are the main themes of her work throughout her whole career to date?

Éva Tardos focuses on Approximation algorithm, Mathematical optimization, Combinatorics, Mathematical economics and Price of anarchy. In her research on the topic of Approximation algorithm, Submodular set function is strongly related with Optimization problem. Her study looks at the relationship between Mathematical optimization and topics such as Algorithm, which overlap with Simple, Maximum flow problem and Polynomial.

Her Combinatorics study combines topics in areas such as Discrete mathematics, Linear programming and Combinatorial optimization. Her research investigates the connection between Mathematical economics and topics such as Common value auction that intersect with issues in Greedy algorithm. While the research belongs to areas of Algorithmic game theory, Éva Tardos spends her time largely on the problem of Algorithmics, intersecting her research to questions surrounding Theoretical computer science and Game complexity.

She most often published in these fields:

  • Approximation algorithm (27.75%)
  • Mathematical optimization (26.79%)
  • Combinatorics (21.05%)

What were the highlights of her more recent work (between 2012-2021)?

  • Mathematical economics (20.57%)
  • Price of anarchy (15.31%)
  • Mathematical optimization (26.79%)

In recent papers she was focusing on the following fields of study:

Her main research concerns Mathematical economics, Price of anarchy, Mathematical optimization, Regret and Common value auction. Her studies deal with areas such as Generalized second-price auction and Market clearing as well as Mathematical economics. Éva Tardos interconnects Algorithm and Algorithmic game theory in the investigation of issues within Price of anarchy.

Éva Tardos works in the field of Mathematical optimization, namely Submodular set function. Her Submodular set function research incorporates themes from Social network analysis, Viral marketing, Social network, Centrality and Heuristics. As part of one scientific family, Éva Tardos deals mainly with the area of Common value auction, narrowing it down to issues related to the Greedy algorithm, and often Approximation algorithm, Inefficiency and Cardinality.

Between 2012 and 2021, her most popular works were:

  • Maximizing the Spread of Influence through a Social Network (324 citations)
  • Composable and efficient mechanisms (141 citations)
  • Bounding the inefficiency of outcomes in generalized second price auctions (45 citations)

In her most recent research, the most cited papers focused on:

  • Algorithm
  • Computer network
  • The Internet

Éva Tardos mainly focuses on Mathematical economics, Nash equilibrium, Price of anarchy, Generalized second-price auction and Repeated game. Her Mathematical economics research includes themes of Class, Vickrey auction and Common value auction. Her Nash equilibrium study deals with Bounding overwatch intersecting with Potential game, Congestion game and Network planning and design.

Within one scientific family, she focuses on topics pertaining to Regret under Repeated game, and may sometimes address concerns connected to Discrete mathematics. In her articles, she combines various disciplines, including High probability and Mathematical optimization. Her Mathematical optimization course of study focuses on Payment and Mechanism design.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Maximizing the spread of influence through a social network

David Kempe;Jon M. Kleinberg;Éva Tardos.
knowledge discovery and data mining (2003)

7631 Citations

Algorithm Design

Jon Kleinberg;Eva Tardos.
(2005)

2276 Citations

How bad is selfish routing

Tim Roughgarden;Éva Tardos.
Journal of the ACM (2002)

2136 Citations

Algorithmic Game Theory: Computing in Games

Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani.
(2007)

1955 Citations

Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria

Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani.
(2007)

1950 Citations

Approximation algorithms for scheduling unrelated parallel machines

J. K. Lenstra;D. B. Shmoys;É. Tardos.
Mathematical Programming (1990)

1112 Citations

Influential nodes in a diffusion model for social networks

David Kempe;Jon Kleinberg;Éva Tardos.
international colloquium on automata languages and programming (2005)

1093 Citations

The Price of Stability for Network Design with Fair Cost Allocation

Elliot Anshelevich;Anirban Dasgupta;Jon Kleinberg;Éva Tardos.
SIAM Journal on Computing (2008)

982 Citations

Approximation algorithms for facility location problems

D.B. Shmoys;É. Tardos;K.I. Aardal.
Universiteit Utrecht. UU-CS, Department of Computer Science (1997)

879 Citations

An approximation algorithm for the generalized assignment problem

David B. Shmoys;Éva Tardos.
Mathematical Programming (1993)

785 Citations

Best Scientists Citing Éva Tardos

Tim Roughgarden

Tim Roughgarden

Columbia University

Publications: 85

Klaus Jansen

Klaus Jansen

Kiel University

Publications: 79

Weili Wu

Weili Wu

The University of Texas at Dallas

Publications: 77

Philip S. Yu

Philip S. Yu

University of Illinois at Chicago

Publications: 65

Vahab Mirrokni

Vahab Mirrokni

Google (United States)

Publications: 59

Hiroshi Motoda

Hiroshi Motoda

Osaka University

Publications: 57

Joseph (Seffi) Naor

Joseph (Seffi) Naor

Technion – Israel Institute of Technology

Publications: 56

Anupam Gupta

Anupam Gupta

Carnegie Mellon University

Publications: 55

MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland, College Park

Publications: 55

Paul G. Spirakis

Paul G. Spirakis

University of Liverpool

Publications: 53

Yossi Azar

Yossi Azar

Tel Aviv University

Publications: 52

My T. Thai

My T. Thai

University of Florida

Publications: 50

R. Ravi

R. Ravi

Carnegie Mellon University

Publications: 48

Aravind Srinivasan

Aravind Srinivasan

University of Maryland, College Park

Publications: 47

Moshe Tennenholtz

Moshe Tennenholtz

Technion – Israel Institute of Technology

Publications: 45

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.