Tim Roughgarden
Management Science and Operations Research · 2000–2017
A researcher in the Science corpus: 13 papers; trusts 42 researchers and is trusted by 152 researchers here, as inferred from the citation graph.
Subfields
- Management Science and Operations Research — 42 citations into it; #1,304 of 12,201 by trust here, #2,211 by citations
- Artificial Intelligence — 28 citations into it; #3,152 of 36,961 by trust here, #5,847 by citations
- Computational Theory and Mathematics — 23 citations into it
- Economics and Econometrics — 23 citations into it; #15,122 of 23,545 by trust here, #13,641 by citations
- Privacy & Security — 16 citations into it; #46 of 710 by trust here, #102 by citations
- Computer Networks and Communications — 13 citations into it; #1,254 of 9,996 by trust here, #2,388 by citations
- Marketing — 8 citations into it; #1,803 of 6,315 by trust here, #5,127 by citations
- Safety, Robustness & Interpretability — 7 citations into it
Whom Tim Roughgarden trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- David S. Johnson
- Christos H. Papadimitriou
- Artur Czumaj
- É. Tardos
- Cynthia Dwork
- Berthold Vöcking
- Roger B. Myerson
- Frank McSherry
- Eric Budish
- Leslie G. Valiant
Who trusts Tim Roughgarden overall
- É. Tardos
- Xu Chen
- Jean Oh
- Adrian Weller
- Jonathan Ullman
- Quan Geng
- Xu Chen
- Aaron Roth
- José R. Correa
- Thomas Steinke
Papers from Tim Roughgarden's perspective
Ordered by how strongly the researchers Tim Roughgarden trusts endorse each paper. Same corpus, a different order for every researcher.
- Algorithms, games, and the internet (Symposium on the Theory of Computing)
- Revealing information while preserving privacy
- Towards Sharp Inapproximability For Any 2-CSP
- Differential Privacy
- How bad is selfish routing? (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Privacy-Preserving Datamining on Vertically Partitioned Databases
- The price of anarchy is independent of the network topology (Symposium on the Theory of Computing)
- Practical privacy: the SuLQ framework
- Privacy, accuracy, and consistency too: a holistic solution to contingency table release
- Charging and rate control for elastic traffic
Their papers
- Universally utility-maximizing privacy mechanisms (2008) — 595 citations
- Interactive privacy via the median mechanism (2009) — 291 citations
- The price of anarchy is independent of the network topology (2002) — 602 citations
- Stackelberg scheduling strategies (2001) — 356 citations
- Simple versus optimal mechanisms (2009) — 330 citations
- The price of stability for network design with fair cost allocation (2004) — 1,002 citations
- Revenue maximization with a single sample (2010) — 305 citations
- Bounding the inefficiency of equilibria in nonatomic congestion games (2004) — 363 citations
- The sample complexity of revenue maximization (2014) — 295 citations
- Almost Envy-Freeness with General Valuations (2017) — 296 citations
- The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries (2009) — 20 citations
- Selfish routing and the price of anarchy (2005) — 1,006 citations
- How bad is selfish routing? (2000) — 2,034 citations