×

zbMATH — the first resource for mathematics

Roughgarden, Tim

Compute Distance To:
Author ID: roughgarden.tim Recent zbMATH articles by "Roughgarden, Tim"
Published as: Roughgarden, T.; Roughgarden, Tim
Documents Indexed: 106 Publications since 2001, including 3 Books
all top 5

Co-Authors

18 single-authored
9 Sundararajan, Mukund
9 Tardos, Éva
5 Cole, Richard John
5 Dughmi, Shaddin
4 Bhawalkar, Kshipra
4 Dobzinski, Shahar
4 Dodis, Yevgeniy
4 Dütting, Paul
4 Gupta, Rishi
4 Roth, Aaron Leon
4 Talgam-Cohen, Inbal
4 Yan, Qiqi
3 Chawla, Shuchi
3 Chen, Ho-Lin
3 Gkatzelis, Vasilis
3 Hartline, Jason D.
3 Hsu, Justin
3 Huang, Zhiyi
3 Kleinberg, Jon Michael
3 Kollias, Konstantinos
3 Lin, Henry W.
3 Mehta, Aranyak
3 Mosk-Aoyama, Damon
3 Seshadhri, Comandur
3 Valiant, Gregory
3 Wang, Joshua R.
2 Chudak, Fabián A.
2 Dhangwatnotai, Peerapong
2 Feldman, Michal
2 Gupta, Anupam
2 Krauthgamer, Robert
2 Kumar, Amit
2 Leonardi, Stefano
2 Lewi, Kevin
2 Nisan, Noam
2 Papadimitriou, Christos Harilaos
2 Plaut, Benjamin
2 Schoppmann, Florian
2 Shah, Devavrat
2 Sharma, Aneesh
2 Syrgkanis, Vasilis
2 Walkover, Asher
2 Williamson, David P.
2 Wu, Zhiwei Steven
1 Anshelevich, Elliot
1 Badanidiyuru, Ashwinkumar
1 Bhattacharya, Sayan
1 Chatziafratis, Vaggos
1 Chen, Yan
1 Dasgupta, Anirban
1 Devanur, Nikhil R.
1 Ezra, Tomer
1 Fleischer, Lisa K.
1 Fox, Jacob
1 Fu, Hu
1 Gairing, Martin
1 Ghosh, Arpita
1 Ghosh, Arpita
1 Haviv, Moshe
1 Hoffman, Alan J.
1 Immorlica, Nicole
1 Jenkins, Kate
1 Kleinberg, Robert D.
1 Koutsoupias, Elias
1 Kulkarni, Janardhan
1 Lucier, Brendan
1 Mansour, Yishay
1 Marden, Jason R.
1 Niazadeh, Rad
1 Pál, Martin
1 Schrijvers, Okke
1 Suksompong, Warut
1 Ullman, Jonathan R.
1 Vassilvitskii, Sergei
1 Vazirani, Vijay V.
1 Vondrák, Jan
1 Wei, Fan
1 Wein, Nicole
1 Wexler, Tom
1 Xu, Xiaoming

Publications by Year

Citations contained in zbMATH Open

88 Publications have been cited 1,857 times in 1,071 Documents Cited by Year
How bad is selfish routing? Zbl 1323.90011
Roughgarden, Tim; Tardos, Éva
238
2002
Algorithmic game theory. Foreword by Christos H. Papadimitriou. Zbl 1130.91005
Nisan, Noam (ed.); Roughgarden, Tim (ed.); Tardos, Éva (ed.); Vazirani, Vijay V. (ed.)
212
2007
The price of stability for network design with fair cost allocation. Zbl 1173.91321
Anshelevich, Elliot; Dasgupta, Anirban; Kleinberg, Jon; Tardos, Éva; Wexler, Tom; Roughgarden, Tim
188
2008
Interactive privacy via the median mechanism. Zbl 1293.68114
Roth, Aaron; Roughgarden, Tim
104
2010
The maximum latency of selfish routing. Zbl 1318.68065
Roughgarden, Tim
93
2004
Bounding the inefficiency of equilibria in nonatomic congestion games. Zbl 1068.91002
Roughgarden, Tim; Tardos, Éva
50
2004
The price of anarchy is independent of the network topology. Zbl 1072.68025
Roughgarden, Tim
50
2003
Intrinsic robustness of the price of anarchy. Zbl 1304.91019
Roughgarden, Tim
39
2009
How much can taxes help selfish routing? Zbl 1103.68018
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
37
2006
Network design with weighted players. Zbl 1176.91003
Chen, Ho-Lin; Roughgarden, Tim
36
2009
On the severity of Braess’s paradox: designing networks for selfish users is hard. Zbl 1094.68122
Roughgarden, Tim
36
2006
Stackelberg scheduling strategies. Zbl 1080.90046
Roughgarden, Tim
34
2004
Computing correlated equilibria in multi-player games. Zbl 1314.91012
Papadimitriou, Christos H.; Roughgarden, Tim
29
2008
Welfare guarantees for combinatorial auctions with item bidding. Zbl 1377.91102
Bhawalkar, Kshipra; Roughgarden, Tim
28
2011
Optimal mechanism design and money burning. Zbl 1231.91117
Hartline, Jason D.; Roughgarden, Tim
27
2008
Simpler and better approximation algorithms for network design. Zbl 1192.90226
Gupta, Anupam; Kumar, Amit; Roughgarden, Tim
27
2003
Revenue maximization with a single sample. Zbl 1318.91088
Dhangwatnotai, Peerapong; Roughgarden, Tim; Yan, Qiqi
24
2015
Pricing network edges for heterogeneous selfish users. Zbl 1192.68032
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
24
2003
The price of anarchy is independent of the network topology. Zbl 1192.68054
Roughgarden, Tim
24
2002
Designing network protocols for good equilibria. Zbl 1207.68164
Chen, Ho-Lin; Roughgarden, Tim; Valiant, Gregory
22
2010
Local smoothness and the price of anarchy in splittable congestion games. Zbl 1314.91013
Roughgarden, Tim; Schoppmann, Florian
19
2015
Truthful approximation schemes for single-parameter agents. Zbl 1234.68460
Dhangwatnotai, Peerapong; Dobzinski, Shahar; Dughmi, Shaddin; Roughgarden, Tim
19
2011
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness. Zbl 1287.91026
Bhawalkar, Kshipra; Gairing, Martin; Roughgarden, Tim
17
2010
Computing equilibria in multi-player games. Zbl 1297.91005
Papadimitriou, Christos H.; Roughgarden, Tim
17
2005
Approximation via cost sharing: simpler and better approximation algorithms for network design. Zbl 1216.68339
Gupta, Anupam; Kumar, Amit; Pál, Martin; Roughgarden, Tim
16
2007
Stackelberg scheduling strategies. Zbl 1323.90022
Roughgarden, Tim
16
2001
Selfish routing with atomic players. Zbl 1297.91037
Roughgarden, Tim
15
2005
Intrinsic robustness of the price of anarchy. Zbl 1427.91015
Roughgarden, Tim
14
2015
Beyond Moulin mechanisms. Zbl 1168.91314
Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund
14
2009
Routing games. Zbl 1152.91329
Roughgarden, Tim
14
2007
Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation. Zbl 1116.90104
Chudak, Fabián A.; Roughgarden, Tim; Williamson, David P.
14
2004
How unfair is optimal routing? Zbl 1258.90017
Roughgarden, Tim
14
2002
Restoring pure equilibria to weighted congestion games. Zbl 1334.91024
Kollias, Konstantinos; Roughgarden, Tim
13
2011
Quantifying inefficiency in cost-sharing mechanisms. Zbl 1325.91033
Roughgarden, Tim; Sundararajan, Mukund
13
2009
Designing networks with good equilibria. Zbl 1192.90021
Chen, Ho-Lin; Roughgarden, Tim; Valiant, Gregory
13
2008
The price of anarchy in an exponential multi-server. Zbl 1149.90323
Haviv, Moshe; Roughgarden, Tim
13
2007
Stronger bounds on Braess’s paradox and the maximum latency of selfish routing. Zbl 1234.68155
Lin, Henry; Roughgarden, Tim; Tardos, Éva; Walkover, Asher
12
2011
Universally utility-maximizing privacy mechanisms. Zbl 1304.94060
Ghosh, Arpita; Roughgarden, Tim; Sundararajan, Mukund
12
2009
The sample complexity of revenue maximization. Zbl 1315.91026
Cole, Richard; Roughgarden, Tim
11
2014
Braess’s paradox in large random graphs. Zbl 1207.05185
Valiant, Gregory; Roughgarden, Tim
11
2010
Computing equilibria: a computational complexity perspective. Zbl 1192.91035
Roughgarden, Tim
11
2010
Introduction to the inefficiency of equilibria. Zbl 1151.91336
Roughgarden, Tim; Tardos, Éva
11
2007
Black-box randomized reductions in algorithmic mechanism design. Zbl 1301.68158
Dughmi, Shaddin; Roughgarden, Tim
10
2014
Bertrand competition in networks. Zbl 1136.91340
Chawla, Shuchi; Roughgarden, Tim
10
2008
New trade-offs in cost-sharing mechanisms. Zbl 1300.91038
Roughgarden, Tim; Sundararajan, Mukund
10
2006
Local smoothness and the price of anarchy in atomic splittable congestion games. Zbl 1377.91018
Roughgarden, Tim; Schoppmann, Florian
9
2011
Is Shapley cost sharing optimal? Zbl 1136.91496
Dobzinski, Shahar; Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund
9
2008
Optimal efficiency guarantees for network design mechanisms. Zbl 1136.68337
Roughgarden, Tim; Sundararajan, Mukund
9
2007
Bottleneck links, variable demand, and the tragedy of the commons. Zbl 1192.91040
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
9
2006
A stronger bound on Braess’s paradox. Zbl 1318.90016
Lin, Henry; Roughgarden, Tim; Tardos, Éva
9
2004
The performance of deferred-acceptance auctions. Zbl 1386.91072
Dütting, Paul; Gkatzelis, Vasilis; Roughgarden, Tim
8
2017
The price of anarchy in large games. Zbl 1377.91013
Feldman, Michal; Immorlica, Nicole; Lucier, Brendan; Roughgarden, Tim; Syrgkanis, Vasilis
8
2016
Optimal cost-sharing in weighted congestion games. Zbl 1404.91054
Gkatzelis, Vasilis; Kollias, Konstantinos; Roughgarden, Tim
8
2014
From convex optimization to randomized mechanisms, toward optimal combinatorial auctions. Zbl 1288.91103
Dughmi, Shaddin; Roughgarden, Tim; Yan, Qiqi
8
2011
The price of anarchy in auctions. Zbl 1417.91250
Roughgarden, Tim; Syrgkanis, Vasilis; Tardos, Éva
7
2017
Potential functions and the inefficiency of equilibria. Zbl 1099.68043
Roughgarden, Tim
7
2006
Modularity and greed in double auctions. Zbl 1415.91136
Dütting, Paul; Talgam-Cohen, Inbal; Roughgarden, Tim
6
2017
Twenty lectures on algorithmic game theory. Zbl 1376.91003
Roughgarden, Tim
6
2016
Sketching valuation functions. Zbl 1422.91290
Badanidiyuru, Ashwinkumar; Dobzinski, Shahar; Fu, Hu; Kleinberg, Robert; Nisan, Noam; Roughgarden, Tim
6
2012
Revenue submodularity. Zbl 1246.91054
Dughmi, Shaddin; Roughgarden, Tim; Sundararajan, Mukund
6
2012
Braess’s paradox, Fibonacci numbers, and exponential inapproximability. Zbl 1084.90044
Lin, Henry; Roughgarden, Tim; Tardos, Éva; Walkover, Asher
6
2005
Optimal cost-sharing in general resource selection games. Zbl 1354.91082
Gkatzelis, Vasilis; Kollias, Konstantinos; Roughgarden, Tim
5
2016
Preventing unraveling in social networks: the anchored \(k\)-core problem. Zbl 1327.68173
Bhawalkar, Kshipra; Kleinberg, Jon; Lewi, Kevin; Roughgarden, Tim; Sharma, Aneesh
5
2015
Generalized efficiency bounds in distributed resource allocation. Zbl 1360.91100
Marden, Jason R.; Roughgarden, Tim
5
2014
Network cost-sharing without anonymity. Zbl 1403.91071
Roughgarden, Tim; Schrijvers, Okke
5
2014
Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation. Zbl 0987.68102
Chudak, Fabián A.; Roughgarden, Tim; Williamson, David P.
5
2001
Making the most of your samples. Zbl 1390.91146
Huang, Zhiyi; Mansour, Yishay; Roughgarden, Tim
4
2018
Communication complexity (for algorithm designers). Zbl 06602865
Roughgarden, Tim
4
2015
Bottleneck links, variable demand, and the tragedy of the commons. Zbl 1269.91028
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
4
2012
Universally utility-maximizing privacy mechanisms. Zbl 1271.68102
Ghosh, Arpita; Roughgarden, Tim; Sundararajan, Mukund
4
2012
Fully distributed algorithms for convex optimization problems. Zbl 1211.90171
Mosk-Aoyama, Damon; Roughgarden, Tim; Shah, Devavrat
4
2010
Almost envy-freeness with general valuations. Zbl 1437.91237
Plaut, Benjamin; Roughgarden, Tim
3
2020
Communication complexity of discrete fair division. Zbl 1435.91109
Plaut, Benjamin; Roughgarden, Tim
3
2019
The complexity of the k-means method. Zbl 1397.68108
Roughgarden, Tim; Wang, Joshua R.
3
2016
Shuffles and circuits (on lower bounds for modern parallel computation). Zbl 1426.68105
Roughgarden, Tim; Vassilvitskii, Sergei; Wang, Joshua R.
2
2018
Optimal mechanisms for combinatorial auctions and combinatorial public projects via convex rounding. Zbl 1407.91124
Dughmi, Shaddin; Roughgarden, Tim; Yan, Qiqi
2
2016
Decompositions of triangle-dense graphs. Zbl 1332.05114
Gupta, Rishi; Roughgarden, Tim; Seshadhri, C.
2
2016
Decompositions of triangle-dense graphs. Zbl 1365.05245
Gupta, Rishi; Roughgarden, Tim; Seshadhri, C.
2
2014
Privately solving linear programs. Zbl 1410.68109
Hsu, Justin; Roth, Aaron; Roughgarden, Tim; Ullman, Jonathan
2
2014
Preventing unraveling in social networks: the anchored \(k\)-core problem. Zbl 1360.68493
Bhawalkar, Kshipra; Kleinberg, Jon; Lewi, Kevin; Roughgarden, Tim; Sharma, Aneesh
2
2012
Worst-case efficiency analysis of queueing disciplines. Zbl 1248.90040
Mosk-Aoyama, Damon; Roughgarden, Tim
2
2009
Pricing multi-unit markets. Zbl 1443.91160
Ezra, Tomer; Feldman, Michal; Roughgarden, Tim; Suksompong, Warut
1
2018
Is Shapley cost sharing optimal? Zbl 1400.91260
Dobzinski, Shahar; Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund
1
2018
A PAC approach to application-specific algorithm selection. Zbl 1334.68292
Gupta, Rishi; Roughgarden, Tim
1
2016
Private matchings and allocations. Zbl 1315.94116
Hsu, Justin; Huang, Zhiyi; Roth, Aaron; Roughgarden, Tim; Wu, Zhiwei Steven
1
2014
Prior-free auctions with ordered bidders. Zbl 1286.91057
Leonardi, Stefano; Roughgarden, Tim
1
2012
Metric clustering via consistent labeling. Zbl 1231.68285
Krauthgamer, Robert; Roughgarden, Tim
1
2011
Metric clustering via consistent labeling. Zbl 1192.68646
Krauthgamer, Robert; Roughgarden, Tim
1
2008
Almost envy-freeness with general valuations. Zbl 1437.91237
Plaut, Benjamin; Roughgarden, Tim
3
2020
Communication complexity of discrete fair division. Zbl 1435.91109
Plaut, Benjamin; Roughgarden, Tim
3
2019
Making the most of your samples. Zbl 1390.91146
Huang, Zhiyi; Mansour, Yishay; Roughgarden, Tim
4
2018
Shuffles and circuits (on lower bounds for modern parallel computation). Zbl 1426.68105
Roughgarden, Tim; Vassilvitskii, Sergei; Wang, Joshua R.
2
2018
Pricing multi-unit markets. Zbl 1443.91160
Ezra, Tomer; Feldman, Michal; Roughgarden, Tim; Suksompong, Warut
1
2018
Is Shapley cost sharing optimal? Zbl 1400.91260
Dobzinski, Shahar; Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund
1
2018
The performance of deferred-acceptance auctions. Zbl 1386.91072
Dütting, Paul; Gkatzelis, Vasilis; Roughgarden, Tim
8
2017
The price of anarchy in auctions. Zbl 1417.91250
Roughgarden, Tim; Syrgkanis, Vasilis; Tardos, Éva
7
2017
Modularity and greed in double auctions. Zbl 1415.91136
Dütting, Paul; Talgam-Cohen, Inbal; Roughgarden, Tim
6
2017
The price of anarchy in large games. Zbl 1377.91013
Feldman, Michal; Immorlica, Nicole; Lucier, Brendan; Roughgarden, Tim; Syrgkanis, Vasilis
8
2016
Twenty lectures on algorithmic game theory. Zbl 1376.91003
Roughgarden, Tim
6
2016
Optimal cost-sharing in general resource selection games. Zbl 1354.91082
Gkatzelis, Vasilis; Kollias, Konstantinos; Roughgarden, Tim
5
2016
The complexity of the k-means method. Zbl 1397.68108
Roughgarden, Tim; Wang, Joshua R.
3
2016
Optimal mechanisms for combinatorial auctions and combinatorial public projects via convex rounding. Zbl 1407.91124
Dughmi, Shaddin; Roughgarden, Tim; Yan, Qiqi
2
2016
Decompositions of triangle-dense graphs. Zbl 1332.05114
Gupta, Rishi; Roughgarden, Tim; Seshadhri, C.
2
2016
A PAC approach to application-specific algorithm selection. Zbl 1334.68292
Gupta, Rishi; Roughgarden, Tim
1
2016
Revenue maximization with a single sample. Zbl 1318.91088
Dhangwatnotai, Peerapong; Roughgarden, Tim; Yan, Qiqi
24
2015
Local smoothness and the price of anarchy in splittable congestion games. Zbl 1314.91013
Roughgarden, Tim; Schoppmann, Florian
19
2015
Intrinsic robustness of the price of anarchy. Zbl 1427.91015
Roughgarden, Tim
14
2015
Preventing unraveling in social networks: the anchored \(k\)-core problem. Zbl 1327.68173
Bhawalkar, Kshipra; Kleinberg, Jon; Lewi, Kevin; Roughgarden, Tim; Sharma, Aneesh
5
2015
Communication complexity (for algorithm designers). Zbl 06602865
Roughgarden, Tim
4
2015
The sample complexity of revenue maximization. Zbl 1315.91026
Cole, Richard; Roughgarden, Tim
11
2014
Black-box randomized reductions in algorithmic mechanism design. Zbl 1301.68158
Dughmi, Shaddin; Roughgarden, Tim
10
2014
Optimal cost-sharing in weighted congestion games. Zbl 1404.91054
Gkatzelis, Vasilis; Kollias, Konstantinos; Roughgarden, Tim
8
2014
Generalized efficiency bounds in distributed resource allocation. Zbl 1360.91100
Marden, Jason R.; Roughgarden, Tim
5
2014
Network cost-sharing without anonymity. Zbl 1403.91071
Roughgarden, Tim; Schrijvers, Okke
5
2014
Decompositions of triangle-dense graphs. Zbl 1365.05245
Gupta, Rishi; Roughgarden, Tim; Seshadhri, C.
2
2014
Privately solving linear programs. Zbl 1410.68109
Hsu, Justin; Roth, Aaron; Roughgarden, Tim; Ullman, Jonathan
2
2014
Private matchings and allocations. Zbl 1315.94116
Hsu, Justin; Huang, Zhiyi; Roth, Aaron; Roughgarden, Tim; Wu, Zhiwei Steven
1
2014
Sketching valuation functions. Zbl 1422.91290
Badanidiyuru, Ashwinkumar; Dobzinski, Shahar; Fu, Hu; Kleinberg, Robert; Nisan, Noam; Roughgarden, Tim
6
2012
Revenue submodularity. Zbl 1246.91054
Dughmi, Shaddin; Roughgarden, Tim; Sundararajan, Mukund
6
2012
Bottleneck links, variable demand, and the tragedy of the commons. Zbl 1269.91028
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
4
2012
Universally utility-maximizing privacy mechanisms. Zbl 1271.68102
Ghosh, Arpita; Roughgarden, Tim; Sundararajan, Mukund
4
2012
Preventing unraveling in social networks: the anchored \(k\)-core problem. Zbl 1360.68493
Bhawalkar, Kshipra; Kleinberg, Jon; Lewi, Kevin; Roughgarden, Tim; Sharma, Aneesh
2
2012
Prior-free auctions with ordered bidders. Zbl 1286.91057
Leonardi, Stefano; Roughgarden, Tim
1
2012
Welfare guarantees for combinatorial auctions with item bidding. Zbl 1377.91102
Bhawalkar, Kshipra; Roughgarden, Tim
28
2011
Truthful approximation schemes for single-parameter agents. Zbl 1234.68460
Dhangwatnotai, Peerapong; Dobzinski, Shahar; Dughmi, Shaddin; Roughgarden, Tim
19
2011
Restoring pure equilibria to weighted congestion games. Zbl 1334.91024
Kollias, Konstantinos; Roughgarden, Tim
13
2011
Stronger bounds on Braess’s paradox and the maximum latency of selfish routing. Zbl 1234.68155
Lin, Henry; Roughgarden, Tim; Tardos, Éva; Walkover, Asher
12
2011
Local smoothness and the price of anarchy in atomic splittable congestion games. Zbl 1377.91018
Roughgarden, Tim; Schoppmann, Florian
9
2011
From convex optimization to randomized mechanisms, toward optimal combinatorial auctions. Zbl 1288.91103
Dughmi, Shaddin; Roughgarden, Tim; Yan, Qiqi
8
2011
Metric clustering via consistent labeling. Zbl 1231.68285
Krauthgamer, Robert; Roughgarden, Tim
1
2011
Interactive privacy via the median mechanism. Zbl 1293.68114
Roth, Aaron; Roughgarden, Tim
104
2010
Designing network protocols for good equilibria. Zbl 1207.68164
Chen, Ho-Lin; Roughgarden, Tim; Valiant, Gregory
22
2010
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness. Zbl 1287.91026
Bhawalkar, Kshipra; Gairing, Martin; Roughgarden, Tim
17
2010
Braess’s paradox in large random graphs. Zbl 1207.05185
Valiant, Gregory; Roughgarden, Tim
11
2010
Computing equilibria: a computational complexity perspective. Zbl 1192.91035
Roughgarden, Tim
11
2010
Fully distributed algorithms for convex optimization problems. Zbl 1211.90171
Mosk-Aoyama, Damon; Roughgarden, Tim; Shah, Devavrat
4
2010
Intrinsic robustness of the price of anarchy. Zbl 1304.91019
Roughgarden, Tim
39
2009
Network design with weighted players. Zbl 1176.91003
Chen, Ho-Lin; Roughgarden, Tim
36
2009
Beyond Moulin mechanisms. Zbl 1168.91314
Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund
14
2009
Quantifying inefficiency in cost-sharing mechanisms. Zbl 1325.91033
Roughgarden, Tim; Sundararajan, Mukund
13
2009
Universally utility-maximizing privacy mechanisms. Zbl 1304.94060
Ghosh, Arpita; Roughgarden, Tim; Sundararajan, Mukund
12
2009
Worst-case efficiency analysis of queueing disciplines. Zbl 1248.90040
Mosk-Aoyama, Damon; Roughgarden, Tim
2
2009
The price of stability for network design with fair cost allocation. Zbl 1173.91321
Anshelevich, Elliot; Dasgupta, Anirban; Kleinberg, Jon; Tardos, Éva; Wexler, Tom; Roughgarden, Tim
188
2008
Computing correlated equilibria in multi-player games. Zbl 1314.91012
Papadimitriou, Christos H.; Roughgarden, Tim
29
2008
Optimal mechanism design and money burning. Zbl 1231.91117
Hartline, Jason D.; Roughgarden, Tim
27
2008
Designing networks with good equilibria. Zbl 1192.90021
Chen, Ho-Lin; Roughgarden, Tim; Valiant, Gregory
13
2008
Bertrand competition in networks. Zbl 1136.91340
Chawla, Shuchi; Roughgarden, Tim
10
2008
Is Shapley cost sharing optimal? Zbl 1136.91496
Dobzinski, Shahar; Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund
9
2008
Metric clustering via consistent labeling. Zbl 1192.68646
Krauthgamer, Robert; Roughgarden, Tim
1
2008
Algorithmic game theory. Foreword by Christos H. Papadimitriou. Zbl 1130.91005
Nisan, Noam (ed.); Roughgarden, Tim (ed.); Tardos, Éva (ed.); Vazirani, Vijay V. (ed.)
212
2007
Approximation via cost sharing: simpler and better approximation algorithms for network design. Zbl 1216.68339
Gupta, Anupam; Kumar, Amit; Pál, Martin; Roughgarden, Tim
16
2007
Routing games. Zbl 1152.91329
Roughgarden, Tim
14
2007
The price of anarchy in an exponential multi-server. Zbl 1149.90323
Haviv, Moshe; Roughgarden, Tim
13
2007
Introduction to the inefficiency of equilibria. Zbl 1151.91336
Roughgarden, Tim; Tardos, Éva
11
2007
Optimal efficiency guarantees for network design mechanisms. Zbl 1136.68337
Roughgarden, Tim; Sundararajan, Mukund
9
2007
How much can taxes help selfish routing? Zbl 1103.68018
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
37
2006
On the severity of Braess’s paradox: designing networks for selfish users is hard. Zbl 1094.68122
Roughgarden, Tim
36
2006
New trade-offs in cost-sharing mechanisms. Zbl 1300.91038
Roughgarden, Tim; Sundararajan, Mukund
10
2006
Bottleneck links, variable demand, and the tragedy of the commons. Zbl 1192.91040
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
9
2006
Potential functions and the inefficiency of equilibria. Zbl 1099.68043
Roughgarden, Tim
7
2006
Computing equilibria in multi-player games. Zbl 1297.91005
Papadimitriou, Christos H.; Roughgarden, Tim
17
2005
Selfish routing with atomic players. Zbl 1297.91037
Roughgarden, Tim
15
2005
Braess’s paradox, Fibonacci numbers, and exponential inapproximability. Zbl 1084.90044
Lin, Henry; Roughgarden, Tim; Tardos, Éva; Walkover, Asher
6
2005
The maximum latency of selfish routing. Zbl 1318.68065
Roughgarden, Tim
93
2004
Bounding the inefficiency of equilibria in nonatomic congestion games. Zbl 1068.91002
Roughgarden, Tim; Tardos, Éva
50
2004
Stackelberg scheduling strategies. Zbl 1080.90046
Roughgarden, Tim
34
2004
Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation. Zbl 1116.90104
Chudak, Fabián A.; Roughgarden, Tim; Williamson, David P.
14
2004
A stronger bound on Braess’s paradox. Zbl 1318.90016
Lin, Henry; Roughgarden, Tim; Tardos, Éva
9
2004
The price of anarchy is independent of the network topology. Zbl 1072.68025
Roughgarden, Tim
50
2003
Simpler and better approximation algorithms for network design. Zbl 1192.90226
Gupta, Anupam; Kumar, Amit; Roughgarden, Tim
27
2003
Pricing network edges for heterogeneous selfish users. Zbl 1192.68032
Cole, Richard; Dodis, Yevgeniy; Roughgarden, Tim
24
2003
How bad is selfish routing? Zbl 1323.90011
Roughgarden, Tim; Tardos, Éva
238
2002
The price of anarchy is independent of the network topology. Zbl 1192.68054
Roughgarden, Tim
24
2002
How unfair is optimal routing? Zbl 1258.90017
Roughgarden, Tim
14
2002
Stackelberg scheduling strategies. Zbl 1323.90022
Roughgarden, Tim
16
2001
Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation. Zbl 0987.68102
Chudak, Fabián A.; Roughgarden, Tim; Williamson, David P.
5
2001
all top 5

Cited by 1,683 Authors

29 Roughgarden, Tim
21 Bilò, Vittorio
17 Harks, Tobias
16 Fotakis, Dimitris A.
15 Epstein, Leah
15 Flammini, Michele
15 Spirakis, Paul G.
14 Feldman, Michal
14 Moscardelli, Luca
13 Anshelevich, Elliot
13 Christodoulou, George C.
13 Tamir, Tami
12 Fanelli, Angelo
12 Hoefer, Martin
11 Klimm, Max
10 Avni, Guy
10 Caragiannis, Ioannis
10 Chen, Xujin
10 Kupferman, Orna
10 Schafer, Guido
9 Kanellopoulos, Panagiotis
9 Kleinberg, Robert D.
9 Koutsoupias, Elias
9 Monaco, Gianpiero
8 Correa, José R.
8 Gairing, Martin
8 Hartline, Jason D.
8 Kaklamanis, Christos
8 Moulin, Hervé C.
8 Stier-Moses, Nicolás E.
8 Vöcking, Berthold
7 Chawla, Shuchi
7 Cole, Richard John
7 Hu, Xiaodong
7 Huang, Zhiyi
7 Leonardi, Stefano
7 Mehta, Ruta
7 Mirrokni, Vahab S.
7 Nisan, Noam
7 Papadimitriou, Christos Harilaos
7 Penna, Paolo
7 Sgouritsa, Alkmini
7 Tardos, Éva
7 Uetz, Marc
6 Giannakopoulos, Yiannis
6 Gravin, Nick
6 Huang, Chien-Chung
6 Kaporis, Alexis C.
6 Kleiman, Elena
6 Lucier, Brendan
6 Mansour, Yishay
6 Markakis, Evangelos
6 Mavronicolas, Marios
6 Scarsini, Marco
6 Skopalik, Alexander
6 Suksompong, Warut
6 Tennenholtz, Moshe
6 van Stee, Rob
5 Auletta, Vincenzo
5 Caskurlu, Bugra
5 Chen, Ning
5 de Jong, Jasper
5 Deng, Xiao-Tie
5 Dobzinski, Shahar
5 Dütting, Paul
5 Feldotto, Matthias
5 Fleischer, Lisa K.
5 Gourvès, Laurent
5 Han, Deren
5 Kleer, Pieter
5 Kollias, Konstantinos
5 Krysta, Piotr
5 Kyropoulou, Maria
5 Lianeas, Thanasis
5 Marden, Jason R.
5 Monien, Burkhard
5 Monnot, Jérôme
5 Roth, Aaron Leon
5 Tang, Bo
5 Telelis, Orestis A.
5 Ullman, Jonathan R.
5 Vinci, Cosimo
5 Wattenhofer, Roger P.
5 Yang, Hai
5 Ziedins, Ilze
4 Altman, Eitan
4 Azar, Yossi
4 Brandt, Felix
4 Buchbinder, Niv
4 Cao, Zhigang
4 Cominetti, Roberto
4 Daskalakis, Constantinos
4 Dósa, György
4 Emek, Yuval
4 Ferraioli, Diodato
4 Fischer, Felix
4 Fischer, Simon
4 Forgó, Ferenc
4 Fu, Hu
4 Gabarró, Joaquim
...and 1,583 more Authors
all top 5

Cited in 145 Serials

91 Theoretical Computer Science
82 Games and Economic Behavior
54 Theory of Computing Systems
46 Algorithmica
38 European Journal of Operational Research
30 SIAM Journal on Computing
27 Operations Research Letters
22 Journal of Economic Theory
17 Mathematics of Operations Research
16 Journal of Combinatorial Optimization
15 Mathematical Programming. Series A. Series B
13 Discrete Applied Mathematics
12 Artificial Intelligence
12 Information Processing Letters
12 Operations Research
11 Networks
10 International Journal of Game Theory
10 Journal of Computer and System Sciences
9 Automatica
9 Distributed Computing
8 Annals of Operations Research
7 Mathematical Social Sciences
7 Information and Computation
7 Economic Theory
7 CEJOR. Central European Journal of Operations Research
7 Networks and Spatial Economics
6 International Journal of Control
6 Computers & Operations Research
6 Discrete Optimization
6 Games
6 Dynamic Games and Applications
6 Computer Science Review
5 Applied Mathematics and Computation
5 Journal of Mathematical Economics
5 SIAM Journal on Discrete Mathematics
5 Queueing Systems
5 Random Structures & Algorithms
5 International Game Theory Review
4 Journal of Optimization Theory and Applications
4 Theory and Decision
4 Journal of Global Optimization
4 Automation and Remote Control
4 Mathematical Methods of Operations Research
4 Journal of Scheduling
4 OR Spectrum
3 Acta Informatica
3 Social Choice and Welfare
3 Journal of Parallel and Distributed Computing
3 Economics Letters
3 International Journal of Foundations of Computer Science
3 SIAM Journal on Optimization
3 Annals of Mathematics and Artificial Intelligence
3 Mathematical Problems in Engineering
3 Optimization Letters
2 Computers & Mathematics with Applications
2 Discrete Mathematics
2 Computing
2 Naval Research Logistics
2 SIAM Journal on Control and Optimization
2 Synthese
2 Statistical Science
2 Journal of Computer Science and Technology
2 MSCS. Mathematical Structures in Computer Science
2 Computational Optimization and Applications
2 The Journal of Artificial Intelligence Research (JAIR)
2 International Transactions in Operational Research
2 Constraints
2 INFORMS Journal on Computing
2 RAIRO. Operations Research
2 Review of Economic Design
2 Journal of Systems Science and Complexity
2 Journal of Machine Learning Research (JMLR)
2 Journal of Discrete Algorithms
2 Internet Mathematics
2 Computational Management Science
2 Journal of Industrial and Management Optimization
2 Theoretical Economics
1 Advances in Applied Probability
1 Journal of Statistical Physics
1 Physica A
1 Physics Letters. A
1 ACM Transactions on Database Systems
1 Mathematics Magazine
1 The Annals of Statistics
1 Information Sciences
1 Journal of Computational and Applied Mathematics
1 Advances in Applied Mathematics
1 Systems & Control Letters
1 Science of Computer Programming
1 Combinatorica
1 Physica D
1 Optimization
1 Probability Theory and Related Fields
1 Discrete & Computational Geometry
1 International Journal of Approximate Reasoning
1 Asia-Pacific Journal of Operational Research
1 Journal of Cryptology
1 European Journal of Applied Mathematics
1 Real-Time Systems
1 Machine Learning
...and 45 more Serials

Citations by Year