Tim Roughgarden

2008
52	EE	Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden: Truthful Approximation Schemes for Single-Parameter Agents. FOCS 2008: 15-24
51	EE	Tim Roughgarden: Algorithmic Game Theory: Some Greatest Hits and Future Directions. IFIP TCS 2008: 21-42
50	EE	Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Is Shapley Cost Sharing Optimal? SAGT 2008: 327-336
49	EE	Shuchi Chawla, Tim Roughgarden: Bertrand Competition in Networks. SAGT 2008: 70-82
48	EE	Robert Krauthgamer, Tim Roughgarden: Metric clustering via consistent labeling. SODA 2008: 809-818
47	EE	Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing networks with good equilibria. SODA 2008: 854-863
46	EE	Jason D. Hartline, Tim Roughgarden: Optimal mechanism design and money burning. STOC 2008: 75-84
45	EE	Jason D. Hartline, Tim Roughgarden: Optimal Mechansim Design and Money Burning CoRR abs/0804.2097: (2008)
44	EE	Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan: Universally Utility-Maximizing Privacy Mechanisms CoRR abs/0811.2841: (2008)
43	EE	Christos H. Papadimitriou, Tim Roughgarden: Computing correlated equilibria in multi-player games. J. ACM 55(3): (2008)
42	EE	Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden: The Price of Stability for Network Design with Fair Cost Allocation. SIAM J. Comput. 38(4): 1602-1623 (2008)
2007
41	EE	Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond moulin mechanisms. ACM Conference on Electronic Commerce 2007: 1-10
40	EE	Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493
39	EE	Tim Roughgarden, Mukund Sundararajan: Optimal Efficiency Guarantees for Network Design Mechanisms. IPCO 2007: 469-483
38	EE	Levente Buttyán, Jean-Pierre Hubaux, Li Li, Xiang-Yang Li, Tim Roughgarden, Alberto Leon-Garcia: Guest Editorial Non-Cooperative Behavior in Networking. IEEE Journal on Selected Areas in Communications 25(6): 1065-1068 (2007)
37	EE	Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007)
36	EE	Moshe Haviv, Tim Roughgarden: The price of anarchy in an exponential multi-server. Oper. Res. Lett. 35(4): 421-426 (2007)
2006
35	EE	Gregory Valiant, Tim Roughgarden: Braess's paradox in large random graphs. ACM Conference on Electronic Commerce 2006: 296-305
34	EE	Shuchi Chawla, Tim Roughgarden: Single-Source Stochastic Routing. APPROX-RANDOM 2006: 82-94
33	EE	Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden: Routers with Very Small Buffers. INFOCOM 2006
32	EE	Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Bottleneck links, variable demand, and the tragedy of the commons. SODA 2006: 668-677
31	EE	Ho-Lin Chen, Tim Roughgarden: Network design with weighted players. SPAA 2006: 29-38
30	EE	Tim Roughgarden, Mukund Sundararajan: New trade-offs in cost-sharing mechanisms. STOC 2006: 79-88
29	EE	Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan: Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. WINE 2006: 112-123
28	EE	Tim Roughgarden, Mukund Sundararajan: Approximately Efficient Cost-Sharing Mechanisms CoRR abs/cs/0606127: (2006)
27	EE	Mitul Saha, Tim Roughgarden, Jean-Claude Latombe, Gildardo Sánchez-Ante: Planning Tours of Robotic Arms among Partitioned Goals. I. J. Robotic Res. 25(3): 207-223 (2006)
26	EE	Richard Cole, Yevgeniy Dodis, Tim Roughgarden: How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3): 444-467 (2006)
25	EE	Tim Roughgarden: On the severity of Braess's Paradox: Designing networks for selfish users is hard. J. Comput. Syst. Sci. 72(5): 922-953 (2006)
2005
24	EE	Henry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover: Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. ICALP 2005: 497-512
23	EE	Tim Roughgarden: Selfish routing with atomic players. SODA 2005: 1184-1185
22	EE	Christos H. Papadimitriou, Tim Roughgarden: Computing equilibria in multi-player games. SODA 2005: 82-91
21	EE	Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden: Part III: routers with very small buffers. Computer Communication Review 35(3): 83-90 (2005)
20	EE	Tim Roughgarden: An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner. SIGACT News 36(4): 111-114 (2005)
2004
19	EE	Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden: The Price of Stability for Network Design with Fair Cost Allocation. FOCS 2004: 295-304
18	EE	Henry Lin, Tim Roughgarden, Éva Tardos: A stronger bound on Braess's Paradox. SODA 2004: 340-341
17	EE	Tim Roughgarden: The maximum latency of selfish routing. SODA 2004: 980-981
16	EE	Fabián A. Chudak, Tim Roughgarden, David P. Williamson: Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Math. Program. 100(2): 411-421 (2004)
15	EE	Tim Roughgarden: Stackelberg Scheduling Strategies. SIAM J. Comput. 33(2): 332-350 (2004)
2003
14	EE	Richard Cole, Yevgeniy Dodis, Tim Roughgarden: How much can taxes help selfish routing? ACM Conference on Electronic Commerce 2003: 98-107
13	EE	Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606-
12	EE	Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372
11	EE	Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Pricing network edges for heterogeneous selfish users. STOC 2003: 521-530
10	EE	Tim Roughgarden: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2): 341-364 (2003)
2002
9	EE	Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333-
8	EE	Tim Roughgarden: How unfair is optimal routing? SODA 2002: 203-204
7	EE	Tim Roughgarden: The price of anarchy is independent of the network topology. STOC 2002: 428-437
6	EE	Alan J. Hoffman, Kate Jenkins, Tim Roughgarden: On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002)
5	EE	Tim Roughgarden, Éva Tardos: How bad is selfish routing? J. ACM 49(2): 236-259 (2002)
2001
4		Tim Roughgarden: Designing Networks for Selfish Users is Hard. FOCS 2001: 472-481
3	EE	Fabián A. Chudak, Tim Roughgarden, David P. Williamson: Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. IPCO 2001: 60-70
2	EE	Tim Roughgarden: Stackelberg scheduling strategies. STOC 2001: 104-113
2000
1		Tim Roughgarden, Éva Tardos: How Bad is Selfish Routing? FOCS 2000: 93-102

Coauthor Index

1	Elliot Anshelevich	[19] [42]
2	Levente Buttyán	[38]
3	Shuchi Chawla	[29] [34] [49]
4	Ho-Lin Chen	[31] [47]
5	Fabián A. Chudak	[3] [16]
6	Richard Cole	[11] [14] [26] [32]
7	Anirban Dasgupta	[19] [42]
8	Peerapong Dhangwatnotai	[52]
9	Shahar Dobzinski	[50] [52]
10	Yevgeniy Dodis	[11] [14] [26] [32]
11	Shaddin Dughmi	[52]
12	Mihaela Enachescu	[21] [33]
13	Yashar Ganjali	[21] [33]
14	Arpita Ghosh	[44]
15	Ashish Goel	[21] [33]
16	Anupam Gupta	[9] [12] [13] [37]
17	Jason D. Hartline	[45] [46]
18	Moshe Haviv	[36]
19	Alan J. Hoffman	[6]
20	Jean-Pierre Hubaux	[38]
21	Kate Jenkins	[6]
22	Jon M. Kleinberg	[19] [42]
23	Robert Krauthgamer	[48]
24	Amit Kumar	[9] [12] [13] [37]
25	Jean-Claude Latombe	[27]
26	Alberto Leon-Garcia	[38]
27	Li Li	[38]
28	Xiang-Yang Li	[38]
29	Henry Lin	[18] [24]
30	Nick McKeown	[21] [33]
31	Aranyak Mehta	[41] [50]
32	Damon Mosk-Aoyama	[40]
33	Martin Pál (Martin Pal)	[13] [37]
34	Christos H. Papadimitriou	[22] [43]
35	Mitul Saha	[27]
36	Gildardo Sánchez-Ante	[27]
37	Devavrat Shah	[40]
38	Mukund Sundararajan	[28] [29] [30] [39] [41] [44] [50]
39	Éva Tardos	[1] [5] [18] [19] [24] [42]
40	Gregory Valiant	[35] [47]
41	Asher Walkover	[24]
42	Tom Wexler	[19] [42]
43	David P. Williamson	[3] [16]

Colors in the list of coauthors