Tim Roughgarden

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
37An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries. Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan. CoRR (abs/1109.1053) (2011). Web SearchBibTeXDownload
2010
36Braess's Paradox in large random graphs. Gregory Valiant, Tim Roughgarden. Random Struct. Algorithms (37): 495-515 (2010). Web SearchBibTeXDownload
35Designing Network Protocols for Good Equilibria. Ho-Lin Chen, Tim Roughgarden, Gregory Valiant. SIAM J. Comput. (39): 1799-1832 (2010). Web SearchBibTeXDownload
34Fully Distributed Algorithms for Convex Optimization Problems. Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah. SIAM Journal on Optimization (20): 3260-3279 (2010). Web SearchBibTeXDownload
2009
33Revenue submodularity. Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan. ACM Conference on Electronic Commerce 2009, 243-252. Web SearchBibTeXDownload
32Revenue Submodularity. Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan. AMMA 2009, 89-91. Web SearchBibTeXDownload
31Quantifying inefficiency in cost-sharing mechanisms. Tim Roughgarden, Mukund Sundararajan. J. ACM (56) (2009). Web SearchBibTeXDownload
30Universally utility-maximizing privacy mechanisms. Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan. STOC 2009, 351-360. Web SearchBibTeXDownload
2008
29Universally Utility-Maximizing Privacy Mechanisms. Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan. CoRR (abs/0811.2841) (2008). Web SearchBibTeXDownload
28Computing correlated equilibria in multi-player games. Christos H. Papadimitriou, Tim Roughgarden. J. ACM (55) (2008). Web SearchBibTeXDownload
27Is Shapley Cost Sharing Optimal?. Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan. SAGT 2008, 327-336. Web SearchBibTeXDownload
26The Price of Stability for Network Design with Fair Cost Allocation. Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden. SIAM J. Comput. (38): 1602-1623 (2008). Web SearchBibTeXDownload
25Metric clustering via consistent labeling. Robert Krauthgamer, Tim Roughgarden. SODA 2008, 809-818. Web SearchBibTeXDownload
24Designing networks with good equilibria. Ho-Lin Chen, Tim Roughgarden, Gregory Valiant. SODA 2008, 854-863. Web SearchBibTeXDownload
2007
23Beyond moulin mechanisms. Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan. ACM Conference on Electronic Commerce 2007, 1-10. Web SearchBibTeXDownload
22Fully Distributed Algorithms for Convex Optimization Problems. Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah. DISC 2007, 492-493. Web SearchBibTeXDownload
21Optimal Efficiency Guarantees for Network Design Mechanisms. Tim Roughgarden, Mukund Sundararajan. IPCO 2007, 469-483. Web SearchBibTeXDownload
20Approximation via cost sharing: Simpler and better approximation algorithms for network design. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden. J. ACM (54): 11 (2007). Web SearchBibTeXDownload
2006
19Braess's paradox in large random graphs. Gregory Valiant, Tim Roughgarden. ACM Conference on Electronic Commerce 2006, 296-305. Web SearchBibTeXDownload
18Approximately Efficient Cost-Sharing Mechanisms. Tim Roughgarden, Mukund Sundararajan. CoRR (abs/cs/0606127) (2006). Web SearchBibTeXDownload
17Routers with Very Small Buffers. Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden. INFOCOM 2006. Web SearchBibTeXDownload
16How much can taxes help selfish routing?. Richard Cole, Yevgeniy Dodis, Tim Roughgarden. J. Comput. Syst. Sci. (72): 444-467 (2006). Web SearchBibTeXDownload
15Bottleneck links, variable demand, and the tragedy of the commons. Richard Cole, Yevgeniy Dodis, Tim Roughgarden. SODA 2006, 668-677. Web SearchBibTeXDownload
14New trade-offs in cost-sharing mechanisms. Tim Roughgarden, Mukund Sundararajan. STOC 2006, 79-88. Web SearchBibTeXDownload
13Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan. WINE 2006, 112-123. Web SearchBibTeXDownload
2005
12Part III: routers with very small buffers. Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden. Computer Communication Review (35): 83-90 (2005). Web SearchBibTeXDownload
11Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover. ICALP 2005, 497-512. Web SearchBibTeXDownload
10Computing equilibria in multi-player games. Christos H. Papadimitriou, Tim Roughgarden. SODA 2005, 82-91. Web SearchBibTeXDownload
2004
9The Price of Stability for Network Design with Fair Cost Allocation. Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden. FOCS 2004, 295-304. Web SearchBibTeXDownload
8A stronger bound on Braess's Paradox. Henry C. Lin, Tim Roughgarden, Éva Tardos. SODA 2004, 340-341. Web SearchBibTeXDownload
2003
7How much can taxes help selfish routing?. Richard Cole, Yevgeniy Dodis, Tim Roughgarden. ACM Conference on Electronic Commerce 2003, 98-107. Web SearchBibTeXDownload
6Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden. FOCS 2003, 606-615. Web SearchBibTeXDownload
5Simpler and better approximation algorithms for network design. Anupam Gupta, Amit Kumar, Tim Roughgarden. STOC 2003, 365-372. Web SearchBibTeXDownload
4Pricing network edges for heterogeneous selfish users. Richard Cole, Yevgeniy Dodis, Tim Roughgarden. STOC 2003, 521-530. Web SearchBibTeXDownload
2002
3A Constant-Factor Approximation Algorithm for the Multicommodity. Amit Kumar, Anupam Gupta, Tim Roughgarden. FOCS 2002, 333. Web SearchBibTeXDownload
2How bad is selfish routing?. Tim Roughgarden, Éva Tardos. J. ACM (49): 236-259 (2002). Web SearchBibTeXDownload
2000
1How Bad is Selfish Routing?. Tim Roughgarden, Éva Tardos. FOCS 2000, 93-102. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research