É
Éva Tardos
Researcher at Cornell University
Publications - 224
Citations - 37141
Éva Tardos is an academic researcher from Cornell University. The author has contributed to research in topics: Approximation algorithm & Price of anarchy. The author has an hindex of 71, co-authored 214 publications receiving 34558 citations. Previous affiliations of Éva Tardos include Eötvös Loránd University & Massachusetts Institute of Technology.
Papers
More filters
Proceedings ArticleDOI
Maximizing the spread of influence through a social network
TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Journal ArticleDOI
Maximizing the Spread of Influence through a Social Network
TL;DR: The problem of finding the most influential nodes in a social network is NP-hard as mentioned in this paper, and the first provable approximation guarantees for efficient algorithms were provided by Domingos et al. using an analysis framework based on submodular functions.
Journal ArticleDOI
How bad is selfish routing
Tim Roughgarden,Éva Tardos +1 more
TL;DR: The degradation in network performance due to unregulated traffic is quantified and it is proved that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency.
Book
Algorithm Design
Jon Kleinberg,Éva Tardos +1 more
TL;DR: Algorithm Design introduces algorithms by looking at the real-world problems that motivate them and encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.