Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Tim Roughgarden
2010 – today
- 2013
[c62]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu: Near-optimal multi-unit auctions with ordered bidders. ACM Conference on Electronic Commerce 2013: 91-102- [c61]Tim Roughgarden, Inbal Talgam-Cohen: Optimal and near-optimal mechanism design with interdependent values. ACM Conference on Electronic Commerce 2013: 767-784
- [e2]Dan Boneh, Tim Roughgarden, Joan Feigenbaum (Eds.): Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. ACM 2013, ISBN 978-1-4503-2029-0
- 2012
- [j33]
- [j32]Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Bottleneck links, variable demand, and the tragedy of the commons. Networks 60(3): 194-203 (2012)
- [j31]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan: Universally Utility-maximizing Privacy Mechanisms. SIAM J. Comput. 41(6): 1673-1693 (2012)
- [j30]Tim Roughgarden: The price of anarchy in games of incomplete information. SIGecom Exchanges 11(1): 18-20 (2012)
- [j29]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan: Revenue Submodularity. Theory of Computing 8(1): 95-119 (2012)
- [c60]Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma: Preventing Unraveling in Social Networks: The Anchored k-Core Problem. ICALP (2) 2012: 440-451
- [c59]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden: Combinatorial auctions with restricted complements. ACM Conference on Electronic Commerce 2012: 3-16
- [c58]Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan: Supply-limiting mechanisms. ACM Conference on Electronic Commerce 2012: 844-861
- [c57]Tim Roughgarden: The price of anarchy in games of incomplete information. ACM Conference on Electronic Commerce 2012: 862-879
- [c56]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden: Sketching valuation functions. SODA 2012: 1025-1035
- [c55]
- [c54]
- [i8]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden: Combinatorial Auctions with Restricted Complements. CoRR abs/1205.4104 (2012)
- [i7]Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden: Near-Optimal Multi-Unit Auctions with Ordered Bidders. CoRR abs/1212.2825 (2012)
- 2011
- [j28]Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden: Truthful Approximation Schemes for Single-Parameter Agents. SIAM J. Comput. 40(3): 915-933 (2011)
- [j27]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)
- [j26]Robert Krauthgamer, Tim Roughgarden: Metric Clustering via Consistent Labeling. Theory of Computing 7(1): 49-74 (2011)
- [c53]Uri Nadav, Ramesh Johari, Tim Roughgarden: Uncoupled potentials for proportional allocation markets. CDC-ECE 2011: 4479-4484
- [c52]Konstantinos Kollias, Tim Roughgarden: Restoring Pure Equilibria to Weighted Congestion Games. ICALP (2) 2011: 539-551
- [c51]Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer: Flexible Tree Matching. IJCAI 2011: 2674-2679
- [c50]Tim Roughgarden, Florian Schoppmann: Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. SODA 2011: 255-267
- [c49]Kshipra Bhawalkar, Tim Roughgarden: Welfare Guarantees for Combinatorial Auctions with Item Bidding. SODA 2011: 700-709
- [c48]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. STOC 2011: 149-158
- [e1]Yoav Shoham, Yan Chen, Tim Roughgarden (Eds.): Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011. ACM 2011, ISBN 978-1-4503-0261-6
- [i6]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan: From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders. CoRR abs/1103.0040 (2011)
- [i5]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)
- 2010
- [j25]
- [j24]Gregory Valiant, Tim Roughgarden: Braess's Paradox in large random graphs. Random Struct. Algorithms 37(4): 495-515 (2010)
- [j23]Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing Network Protocols for Good Equilibria. SIAM J. Comput. 39(5): 1799-1832 (2010)
- [j22]Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. SIAM Journal on Optimization 20(6): 3260-3279 (2010)
- [c47]Jason R. Marden, Tim Roughgarden: Generalized efficiency bounds in distributed resource allocation. CDC 2010: 2233-2238
- [c46]Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden: Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. ESA (2) 2010: 17-28
- [c45]Shaddin Dughmi, Tim Roughgarden: Black-Box Randomized Reductions in Algorithmic Mechanism Design. FOCS 2010: 775-784
- [c44]Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan: Revenue maximization with a single sample. ACM Conference on Electronic Commerce 2010: 129-138
- [c43]
- [c42]
2000 – 2009
- 2009
- [j21]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond Moulin mechanisms. Games and Economic Behavior 67(1): 125-155 (2009)
- [j20]Tim Roughgarden, Mukund Sundararajan: Quantifying inefficiency in cost-sharing mechanisms. J. ACM 56(4) (2009)
- [j19]Ho-Lin Chen, Tim Roughgarden: Network Design with Weighted Players. Theory Comput. Syst. 45(2): 302-324 (2009)
- [j18]Shuchi Chawla, Feng Niu, Tim Roughgarden: Bertrand competition in networks. SIGecom Exchanges 8(1) (2009)
- [j17]
- [c41]
- [c40]Damon Mosk-Aoyama, Tim Roughgarden: Worst-Case Efficiency Analysis of Queueing Disciplines. ICALP (2) 2009: 546-557
- [c39]Arik Motskin, Tim Roughgarden, Primoz Skraba, Leonidas J. Guibas: Lightweight Coloring and Desynchronization for Networks. INFOCOM 2009: 2383-2391
- [c38]Jason D. Hartline, Tim Roughgarden: Simple versus optimal mechanisms. ACM Conference on Electronic Commerce 2009: 225-234
- [c37]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan: Revenue submodularity. ACM Conference on Electronic Commerce 2009: 243-252
- [c36]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan: Universally utility-maximizing privacy mechanisms. STOC 2009: 351-360
- [c35]
- [i4]Aaron Roth, Tim Roughgarden: The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries. CoRR abs/0911.1813 (2009)
- 2008
- [j16]Christos H. Papadimitriou, Tim Roughgarden: Computing correlated equilibria in multi-player games. J. ACM 55(3) (2008)
- [j15]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)
- [c34]Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden: Truthful Approximation Schemes for Single-Parameter Agents. FOCS 2008: 15-24
- [c33]Tim Roughgarden: Algorithmic Game Theory: Some Greatest Hits and Future Directions. IFIP TCS 2008: 21-42
- [c32]
- [c31]Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Is Shapley Cost Sharing Optimal? SAGT 2008: 327-336
- [c30]
- [c29]Ho-Lin Chen, Tim Roughgarden, Gregory Valiant: Designing networks with good equilibria. SODA 2008: 854-863
- [c28]
- [i3]Jason D. Hartline, Tim Roughgarden: Optimal Mechansim Design and Money Burning. CoRR abs/0804.2097 (2008)
- [i2]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan: Universally Utility-Maximizing Privacy Mechanisms. CoRR abs/0811.2841 (2008)
- 2007
- [j14]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)
- [j13]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)
- [j12]Moshe Haviv, Tim Roughgarden: The price of anarchy in an exponential multi-server. Oper. Res. Lett. 35(4): 421-426 (2007)
- [c27]Tim Roughgarden, Mukund Sundararajan: Optimal Efficiency Guarantees for Network Design Mechanisms. IPCO 2007: 469-483
- [c26]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond moulin mechanisms. ACM Conference on Electronic Commerce 2007: 1-10
- [c25]Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493
- 2006
- [j11]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)
- [j10]Richard Cole, Yevgeniy Dodis, Tim Roughgarden: How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3): 444-467 (2006)
- [j9]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)
- [c24]
- [c23]Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden: Routers with Very Small Buffers. INFOCOM 2006
- [c22]Gregory Valiant, Tim Roughgarden: Braess's paradox in large random graphs. ACM Conference on Electronic Commerce 2006: 296-305
- [c21]Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Bottleneck links, variable demand, and the tragedy of the commons. SODA 2006: 668-677
- [c20]
- [c19]
- [c18]Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan: Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. WINE 2006: 112-123
- [i1]Tim Roughgarden, Mukund Sundararajan: Approximately Efficient Cost-Sharing Mechanisms. CoRR abs/cs/0606127 (2006)
- 2005
- [b1]Tim Roughgarden: Selfish routing and the price of anarchy. MIT Press 2005, ISBN 978-0-262-18243-0, pp. I-IX, 1-196
- [j8]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)
- [j7]Tim Roughgarden: An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner. SIGACT News 36(4): 111-114 (2005)
- [c17]Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover: Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. ICALP 2005: 497-512
- [c16]Christos H. Papadimitriou, Tim Roughgarden: Computing equilibria in multi-player games. SODA 2005: 82-91
- [c15]
- 2004
- [j6]Tim Roughgarden, Éva Tardos: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior 47(2): 389-403 (2004)
- [j5]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)
- [j4]
- [c14]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
- [c13]
- [c12]
- 2003
- [j3]Tim Roughgarden: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2): 341-364 (2003)
- [c11]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
- [c10]Richard Cole, Yevgeniy Dodis, Tim Roughgarden: How much can taxes help selfish routing? ACM Conference on Electronic Commerce 2003: 98-107
- [c9]Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372
- [c8]Richard Cole, Yevgeniy Dodis, Tim Roughgarden: Pricing network edges for heterogeneous selfish users. STOC 2003: 521-530
- 2002
- [j2]Alan J. Hoffman, Kate Jenkins, Tim Roughgarden: On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002)
- [j1]
- [c7]Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333-
- [c6]
- [c5]
- 2001
- [c4]
- [c3]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
- [c2]
- 2000
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:51 CEST by the dblp team