The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Tim Roughgarden: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shuchi Chawla, Tim Roughgarden
    Single-Source Stochastic Routing. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:82-94 [Conf]
  2. Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
    The Price of Stability for Network Design with Fair Cost Allocation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:295-304 [Conf]
  3. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
    Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:606-0 [Conf]
  4. Amit Kumar, Anupam Gupta, Tim Roughgarden
    A Constant-Factor Approximation Algorithm for the Multicommodity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:333-0 [Conf]
  5. Tim Roughgarden
    Designing Networks for Selfish Users is Hard. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:472-481 [Conf]
  6. Tim Roughgarden, Éva Tardos
    How Bad is Selfish Routing? [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:93-102 [Conf]
  7. Henry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
    Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:497-512 [Conf]
  8. Fabián A. Chudak, Tim Roughgarden, David P. Williamson
    Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:60-70 [Conf]
  9. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    How much can taxes help selfish routing? [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:98-107 [Conf]
  10. Greg Valiant, Tim Roughgarden
    Braess's paradox in large random graphs. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:296-305 [Conf]
  11. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    Bottleneck links, variable demand, and the tragedy of the commons. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:668-677 [Conf]
  12. Henry Lin, Tim Roughgarden, Éva Tardos
    A stronger bound on Braess's Paradox. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:340-341 [Conf]
  13. Tim Roughgarden
    The maximum latency of selfish routing. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:980-981 [Conf]
  14. Tim Roughgarden
    Selfish routing with atomic players. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1184-1185 [Conf]
  15. Christos H. Papadimitriou, Tim Roughgarden
    Computing equilibria in multi-player games. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:82-91 [Conf]
  16. Tim Roughgarden
    How unfair is optimal routing? [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:203-204 [Conf]
  17. Ho-Lin Chen, Tim Roughgarden
    Network design with weighted players. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:29-38 [Conf]
  18. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    Pricing network edges for heterogeneous selfish users. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:521-530 [Conf]
  19. Anupam Gupta, Amit Kumar, Tim Roughgarden
    Simpler and better approximation algorithms for network design. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:365-372 [Conf]
  20. Tim Roughgarden
    Stackelberg scheduling strategies. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:104-113 [Conf]
  21. Tim Roughgarden
    The price of anarchy is independent of the network topology. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:428-437 [Conf]
  22. Tim Roughgarden, Mukund Sundararajan
    New trade-offs in cost-sharing mechanisms. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:79-88 [Conf]
  23. Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan
    Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:112-123 [Conf]
  24. Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden
    Part III: routers with very small buffers. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2005, v:35, n:3, pp:83-90 [Journal]
  25. Mitul Saha, Tim Roughgarden, Jean-Claude Latombe, Gildardo Sánchez-Ante
    Planning Tours of Robotic Arms among Partitioned Goals. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2006, v:25, n:3, pp:207-223 [Journal]
  26. Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
    On a game in directed graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:1, pp:13-16 [Journal]
  27. Tim Roughgarden, Éva Tardos
    How bad is selfish routing? [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:2, pp:236-259 [Journal]
  28. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    How much can taxes help selfish routing? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:3, pp:444-467 [Journal]
  29. Tim Roughgarden
    The price of anarchy is independent of the network topology. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:341-364 [Journal]
  30. Tim Roughgarden
    On the severity of Braess's Paradox: Designing networks for selfish users is hard. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:922-953 [Journal]
  31. Fabián A. Chudak, Tim Roughgarden, David P. Williamson
    Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:100, n:2, pp:411-421 [Journal]
  32. Tim Roughgarden
    Stackelberg Scheduling Strategies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:332-350 [Journal]
  33. Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden
    Routers with Very Small Buffers. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  34. Tim Roughgarden, Mukund Sundararajan
    Optimal Efficiency Guarantees for Network Design Mechanisms. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:469-483 [Conf]
  35. Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
    Beyond moulin mechanisms. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:1-10 [Conf]
  36. Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah
    Fully Distributed Algorithms for Convex Optimization Problems. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:492-493 [Conf]
  37. Tim Roughgarden, Mukund Sundararajan
    Approximately Efficient Cost-Sharing Mechanisms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  38. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
    Approximation via cost sharing: Simpler and better approximation algorithms for network design. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:3, pp:11- [Journal]

  39. Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. [Citation Graph (, )][DBLP]


  40. Truthful Approximation Schemes for Single-Parameter Agents. [Citation Graph (, )][DBLP]


  41. Worst-Case Efficiency Analysis of Queueing Disciplines. [Citation Graph (, )][DBLP]


  42. Algorithmic Game Theory: Some Greatest Hits and Future Directions. [Citation Graph (, )][DBLP]


  43. Lightweight Coloring and Desynchronization for Networks. [Citation Graph (, )][DBLP]


  44. Revenue maximization with a single sample. [Citation Graph (, )][DBLP]


  45. Simple versus optimal mechanisms. [Citation Graph (, )][DBLP]


  46. Revenue submodularity. [Citation Graph (, )][DBLP]


  47. Metric clustering via consistent labeling. [Citation Graph (, )][DBLP]


  48. Designing networks with good equilibria. [Citation Graph (, )][DBLP]


  49. Intrinsic robustness of the price of anarchy. [Citation Graph (, )][DBLP]


  50. Optimal mechanism design and money burning. [Citation Graph (, )][DBLP]


  51. Universally utility-maximizing privacy mechanisms. [Citation Graph (, )][DBLP]


  52. Interactive privacy via the median mechanism. [Citation Graph (, )][DBLP]


  53. Is Shapley Cost Sharing Optimal? [Citation Graph (, )][DBLP]


  54. Bertrand Competition in Networks. [Citation Graph (, )][DBLP]


  55. Revenue Submodularity. [Citation Graph (, )][DBLP]


  56. Algorithmic game theory. [Citation Graph (, )][DBLP]


  57. Optimal Mechansim Design and Money Burning [Citation Graph (, )][DBLP]


  58. Universally Utility-Maximizing Privacy Mechanisms [Citation Graph (, )][DBLP]


  59. The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.308secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002