Tim Roughgarden

	2012
91		Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden: Sketching valuation functions. SODA 2012: 1025-1035
90		Stefano Leonardi, Tim Roughgarden: Prior-free auctions with ordered bidders. STOC 2012: 427-434
	2011
89		Yoav Shoham, Yan Chen, Tim Roughgarden: Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011 ACM 2011
88		Uri Nadav, Ramesh Johari, Tim Roughgarden: Uncoupled potentials for proportional allocation markets. CDC-ECE 2011: 4479-4484
87		Konstantinos Kollias, Tim Roughgarden: Restoring Pure Equilibria to Weighted Congestion Games. ICALP (2) 2011: 539-551
86		Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer: Flexible Tree Matching. IJCAI 2011: 2674-2679
85		Tim Roughgarden, Florian Schoppmann: Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. SODA 2011: 255-267
84		Kshipra Bhawalkar, Tim Roughgarden: Welfare Guarantees for Combinatorial Auctions with Item Bidding. SODA 2011: 700-709
83		Shaddin Dughmi, Tim Roughgarden, Qiqi Yan: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. STOC 2011: 149-158
82		Shaddin Dughmi, Tim Roughgarden, Qiqi Yan: From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders CoRR abs/1103.0040: (2011)
81		Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan: An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries CoRR abs/1109.1053: (2011)
80		Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden: Truthful Approximation Schemes for Single-Parameter Agents. SIAM J. Comput. 40(3): 915-933 (2011)
79		Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover: Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing. SIAM J. Discrete Math. 25(4): 1667-1686 (2011)
78		Robert Krauthgamer, Tim Roughgarden: Metric Clustering via Consistent Labeling. Theory of Computing 7(1): 49-74 (2011)
	2010
77		Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan: Revenue maximization with a single sample. ACM Conference on Electronic Commerce 2010: 129-138
76		Jason R. Marden, Tim Roughgarden: Generalized efficiency bounds in distributed resource allocation. CDC 2010: 2233-2238
75		Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden: Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. ESA (2) 2010: 17-28
74		Shaddin Dughmi, Tim Roughgarden: Black-Box Randomized Reductions in Algorithmic Mechanism Design. FOCS 2010: 775-784
73		Aaron Roth, Tim Roughgarden: Interactive privacy via the median mechanism. STOC 2010: 765-774
72		Uri Nadav, Tim Roughgarden: The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds. WINE 2010: 319-326
71		Tim Roughgarden: Algorithmic game theory. Commun. ACM 53(7): 78-86 (2010)
70		Gregory Valiant, Tim Roughgarden: Braess's Paradox in large random graphs. Random Struct. Algorithms 37(4): 495-515 (2010)
69		Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing Network Protocols for Good Equilibria. SIAM J. Comput. 39(5): 1799-1832 (2010)
68		Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. SIAM Journal on Optimization 20(6): 3260-3279 (2010)
	2009
67		Jason D. Hartline, Tim Roughgarden: Simple versus optimal mechanisms. ACM Conference on Electronic Commerce 2009: 225-234
66		Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan: Revenue submodularity. ACM Conference on Electronic Commerce 2009: 243-252
65		Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan: Revenue Submodularity. AMMA 2009: 89-91
64		Damon Mosk-Aoyama, Tim Roughgarden: Worst-Case Efficiency Analysis of Queueing Disciplines. ICALP (2) 2009: 546-557
63		Arik Motskin, Tim Roughgarden, Primoz Skraba, Leonidas J. Guibas: Lightweight Coloring and Desynchronization for Networks. INFOCOM 2009: 2383-2391
62		Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan: Universally utility-maximizing privacy mechanisms. STOC 2009: 351-360
61		Tim Roughgarden: Intrinsic robustness of the price of anarchy. STOC 2009: 513-522
60		Aaron Roth, Tim Roughgarden: The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries CoRR abs/0911.1813: (2009)
59		Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond Moulin mechanisms. Games and Economic Behavior 67(1): 125-155 (2009)
58		Tim Roughgarden, Mukund Sundararajan: Quantifying inefficiency in cost-sharing mechanisms. J. ACM 56(4): (2009)
57		Shuchi Chawla, Feng Niu, Tim Roughgarden: Bertrand competition in networks. SIGecom Exchanges 8(1): (2009)
56		Jason D. Hartline, Tim Roughgarden: Simple versus optimal mechanisms. SIGecom Exchanges 8(1): (2009)
55		Ho-Lin Chen, Tim Roughgarden: Network Design with Weighted Players. Theory Comput. Syst. 45(2): 302-324 (2009)
	2008
54		Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden: Truthful Approximation Schemes for Single-Parameter Agents. FOCS 2008: 15-24
53		Tim Roughgarden: Algorithmic Game Theory: Some Greatest Hits and Future Directions. IFIP TCS 2008: 21-42
52		Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Is Shapley Cost Sharing Optimal? SAGT 2008: 327-336
51		Shuchi Chawla, Tim Roughgarden: Bertrand Competition in Networks. SAGT 2008: 70-82
50		Robert Krauthgamer, Tim Roughgarden: Metric clustering via consistent labeling. SODA 2008: 809-818
49		Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing networks with good equilibria. SODA 2008: 854-863
48		Jason D. Hartline, Tim Roughgarden: Optimal mechanism design and money burning. STOC 2008: 75-84
47		Jason D. Hartline, Tim Roughgarden: Optimal Mechansim Design and Money Burning CoRR abs/0804.2097: (2008)
46		Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan: Universally Utility-Maximizing Privacy Mechanisms CoRR abs/0811.2841: (2008)
45		Christos H. Papadimitriou, Tim Roughgarden: Computing correlated equilibria in multi-player games. J. ACM 55(3): (2008)
44		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
43		Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond moulin mechanisms. ACM Conference on Electronic Commerce 2007: 1-10
42		Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493
41		Tim Roughgarden, Mukund Sundararajan: Optimal Efficiency Guarantees for Network Design Mechanisms. IPCO 2007: 469-483
40		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)
39		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)
38		Moshe Haviv, Tim Roughgarden: The price of anarchy in an exponential multi-server. Oper. Res. Lett. 35(4): 421-426 (2007)
	2006
37		Gregory Valiant, Tim Roughgarden: Braess's paradox in large random graphs. ACM Conference on Electronic Commerce 2006: 296-305
36		Shuchi Chawla, Tim Roughgarden: Single-Source Stochastic Routing. APPROX-RANDOM 2006: 82-94
35		Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden: Routers with Very Small Buffers. INFOCOM 2006
34		Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Bottleneck links, variable demand, and the tragedy of the commons. SODA 2006: 668-677
33		Ho-Lin Chen, Tim Roughgarden: Network design with weighted players. SPAA 2006: 29-38
32		Tim Roughgarden, Mukund Sundararajan: New trade-offs in cost-sharing mechanisms. STOC 2006: 79-88
31		Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan: Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. WINE 2006: 112-123
30		Tim Roughgarden, Mukund Sundararajan: Approximately Efficient Cost-Sharing Mechanisms CoRR abs/cs/0606127: (2006)
29		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)
28		Richard Cole, Yevgeniy Dodis, Tim Roughgarden: How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3): 444-467 (2006)
27		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
26		Tim Roughgarden: Selfish routing and the price of anarchy. MIT Press 2005: I-IX, 1-196
25		Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover: Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. ICALP 2005: 497-512
24		Tim Roughgarden: Selfish routing with atomic players. SODA 2005: 1184-1185
23		Christos H. Papadimitriou, Tim Roughgarden: Computing equilibria in multi-player games. SODA 2005: 82-91
22		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)
21		Tim Roughgarden: An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner. SIGACT News 36(4): 111-114 (2005)
	2004
20		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
19		Henry C. Lin, Tim Roughgarden, Éva Tardos: A stronger bound on Braess's Paradox. SODA 2004: 340-341
18		Tim Roughgarden: The maximum latency of selfish routing. SODA 2004: 980-981
17		Tim Roughgarden, Éva Tardos: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior 47(2): 389-403 (2004)
16		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		Tim Roughgarden: Stackelberg Scheduling Strategies. SIAM J. Comput. 33(2): 332-350 (2004)
	2003
14		Richard Cole, Yevgeniy Dodis, Tim Roughgarden: How much can taxes help selfish routing? ACM Conference on Electronic Commerce 2003: 98-107
13		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-615
12		Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372
11		Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Pricing network edges for heterogeneous selfish users. STOC 2003: 521-530
10		Tim Roughgarden: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2): 341-364 (2003)
	2002
9		Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333-
8		Tim Roughgarden: How unfair is optimal routing? SODA 2002: 203-204
7		Tim Roughgarden: The price of anarchy is independent of the network topology. STOC 2002: 428-437
6		Alan J. Hoffman, Kate Jenkins, Tim Roughgarden: On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002)
5		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		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		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	Salman Ahmad	[86]
2	Elliot Anshelevich	[20] [44]
3	Ashwinkumar Badanidiyuru (Ashwinkumar Badanidiyuru Varadaraja, B. V. Ashwinkumar)	[91]
4	Kshipra Bhawalkar	[75] [84]
5	Levente Buttyán	[40]
6	Shuchi Chawla	[31] [36] [51] [57]
7	Ho-Lin Chen	[33] [49] [55] [69]
8	Yan Chen	[89]
9	Fabián A. Chudak	[3] [16]
10	Richard Cole	[11] [14] [28] [34]
11	Anirban Dasgupta	[20] [44]
12	Peerapong Dhangwatnotai	[54] [77] [80]
13	Shahar Dobzinski	[52] [54] [80] [91]
14	Yevgeniy Dodis	[11] [14] [28] [34]
15	Shaddin Dughmi	[54] [65] [66] [74] [80] [81] [82] [83]
16	Mihaela Enachescu	[22] [35]
17	Hu Fu	[91]
18	Martin Gairing	[75]
19	Yashar Ganjali	[22] [35]
20	Arpita Ghosh	[46] [62]
21	Ashish Goel	[22] [35]
22	Leonidas J. Guibas	[63]
23	Anupam Gupta	[9] [12] [13] [39]
24	Jason D. Hartline	[47] [48] [56] [67]
25	Moshe Haviv	[38]
26	Alan J. Hoffman	[6]
27	Jean-Pierre Hubaux	[40]
28	Kate Jenkins	[6]
29	Ramesh Johari	[88]
30	Jon M. Kleinberg	[20] [44]
31	Robert D. Kleinberg (Robert Kleinberg)	[91]
32	Scott R. Klemmer	[86]
33	Konstantinos Kollias	[87]
34	Robert Krauthgamer	[50] [78]
35	Amit Kumar	[9] [12] [13] [39]
36	Ranjitha Kumar	[86]
37	Jean-Claude Latombe	[29]
38	Alberto Leon-Garcia	[40]
39	Stefano Leonardi	[90]
40	Li Li	[40]
41	Xiang-Yang Li	[40]
42	Henry C. Lin	[19] [25] [79]
43	Jason R. Marden	[76]
44	Nick McKeown	[22] [35]
45	Aranyak Mehta	[43] [52] [59]
46	Damon Mosk-Aoyama	[42] [64] [68]
47	Arik Motskin	[63]
48	Uri Nadav	[72] [88]
49	Noam Nisan	[91]
50	Feng Niu	[57]
51	Martin Pál (Martin Pal)	[13] [39]
52	Christos H. Papadimitriou	[23] [45]
53	Aaron Roth	[60] [73]
54	Mitul Saha	[29]
55	Gildardo Sánchez-Ante	[29]
56	Florian Schoppmann	[85]
57	Devavrat Shah	[42] [68]
58	Yoav Shoham	[89]
59	Primoz Skraba	[63]
60	Mukund Sundararajan	[30] [31] [32] [41] [43] [46] [52] [58] [59] [62] [65] [66]
61	Jerry O. Talton	[86]
62	Éva Tardos	[1] [5] [17] [19] [20] [25] [44] [79]
63	Gregory Valiant	[37] [49] [69] [70]
64	Jan Vondrák	[81]
65	Asher Walkover	[25] [79]
66	Tom Wexler	[20] [44]
67	David P. Williamson	[3] [16]
68	Qiqi Yan	[77] [81] [82] [83]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page