É. Tardos
Management Science and Operations Research · 1991–2015
A researcher in the Science corpus: 13 papers; trusts 26 researchers and is trusted by 120 researchers here, as inferred from the citation graph.
Subfields
- Management Science and Operations Research — 49 citations into it; #358 of 12,201 by trust here, #276 by citations
- Statistical and Nonlinear Physics — 22 citations into it; #211 of 10,175 by trust here, #281 by citations
- Economics and Econometrics — 20 citations into it; #12,610 of 23,545 by trust here, #12,817 by citations
- Computer Networks and Communications — 16 citations into it; #2,150 of 9,996 by trust here, #3,163 by citations
- Computational Theory and Mathematics — 12 citations into it
- Management Information Systems — 7 citations into it; #509 of 3,381 by trust here, #823 by citations
- Artificial Intelligence — 6 citations into it
Whom É. Tardos trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Tim Roughgarden
- Christos H. Papadimitriou
- Julian Besag
- Frank P. Kelly
- Adrian R. Vetta
- Artur Czumaj
- Pedro M. Domingos
- Stuart Geman
- Elliot Anshelevich
- José R. Correa
Who trusts É. Tardos overall
- Tim Roughgarden
- Matthew O. Jackson
- Sugato Basu
- Eliav Buchnik
- Yajun Wang
- Ryan T. McDonald
- Yann Bramoullé
- Vladimir Kolmogorov
- Amit Goyal
- Thomas Watson
Papers from É. Tardos's perspective
Ordered by how strongly the researchers É. Tardos trusts endorse each paper. Same corpus, a different order for every researcher.
- Algorithms, games, and the internet (Symposium on the Theory of Computing)
- Charging and rate control for elastic traffic
- The complexity of pure Nash equilibria (Symposium on the Theory of Computing)
- The price of anarchy is independent of the network topology (Symposium on the Theory of Computing)
- The Price of Routing Unsplittable Flow (Symposium on the Theory of Computing)
- A Noncooperative Model of Network Formation
- Variations on the shapley value
- Selfish Routing in Capacitated Networks (Mathematics of Operations Research)
- Near-optimal network design with selfish agents (Symposium on the Theory of Computing)
- Spatial Interaction and the Statistical Analysis of Lattice Systems
Their papers
- Maximizing the spread of influence through a social network (2003) — 9,178 citations
- Influential Nodes in a Diffusion Model for Social Networks (2005) — 1,073 citations
- The price of stability for network design with fair cost allocation (2004) — 1,002 citations
- Near-optimal network design with selfish agents (2003) — 298 citations
- Bounding the inefficiency of equilibria in nonatomic congestion games (2004) — 363 citations
- No-Regret Learning in Bayesian Games (2015) — 72 citations
- Algorithm design (2005) — 555 citations
- Network games (2004) — 360 citations
- How bad is selfish routing? (2000) — 2,034 citations
- A constant-factor approximation algorithm for the k-median problem (extended abstract) (1999)
- Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields (1999)
- Approximation algorithms for facility location problems (extended abstract) (1997)
- Fast approximation algorithms for fractional packing and covering problems (1991)