default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy Roughgarden
Tim Roughgarden
Refine list
refinements active!
zoomed in on 312 of 312 records
view refined list in
export refined list as
showing all 312 records
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2025
[c134]Naveen Durvasula, Tim Roughgarden:
Robust Restaking Networks. ITCS 2025: 48:1-48:21- [i83]Andrew Lewis-Pye, Tim Roughgarden:
Beyond Optimal Fault Tolerance. CoRR abs/2501.06044 (2025) - [i82]Jason Milionis, Jens Ernstberger, Joseph Bonneau, Scott Duke Kominers, Tim Roughgarden:
Incentive-Compatible Recovery from Manipulated Signals, with Applications to Decentralized Physical Infrastructure. CoRR abs/2503.07558 (2025) - [i81]Andrew Lewis-Pye, Tim Roughgarden:
Beyond Optimal Fault-Tolerance. IACR Cryptol. ePrint Arch. 2025: 70 (2025) - 2024
- [j82]Nika Haghtalab
, Tim Roughgarden, Abhishek Shetty:
Smoothed Analysis with Adaptive Adversaries. J. ACM 71(3): 19 (2024) - [j81]Tim Roughgarden:
Transaction Fee Mechanism Design. J. ACM 71(4): 30:1-30:25 (2024) - [c133]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Transaction Fee Mechanism Design in a Post-MEV World. AFT 2024: 29:1-29:24 - [c132]William Brown, Christos H. Papadimitriou, Tim Roughgarden:
Online Stackelberg Optimization via Nonlinear Control. COLT 2024: 697-749 - [c131]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Transaction Fee Mechanism Design with Active Block Producers. FC Workshops 2024: 85-90 - [c130]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
Automated Market Making and Arbitrage Profits in the Presence of Fees. FC (1) 2024: 159-171 - [c129]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Centralization in Block-Building and Proposer-Builder Separation. FC (1) 2024: 331-349 - [c128]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers. ITCS 2024: 81:1-81:19 - [c127]Tim Roughgarden:
Keynote: Provable Slashing Guarantees. PODC 2024: 2 - [c126]Eric Budish, Andrew Lewis-Pye, Tim Roughgarden:
The Economic Limits of Permissionless Consensus. EC 2024: 704-731 - [c125]Hao Chung, Tim Roughgarden, Elaine Shi:
Collusion-Resilience in Transaction Fee Mechanism Design. EC 2024: 1045-1073 - [c124]Tim Roughgarden:
The Computer in the Sky (Keynote). STOC 2024: 1 - [i80]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Centralization in Block Building and Proposer-Builder Separation. CoRR abs/2401.12120 (2024) - [i79]Hao Chung, Tim Roughgarden, Elaine Shi:
Collusion-Resilience in Transaction Fee Mechanism Design. CoRR abs/2402.09321 (2024) - [i78]Andrew Komo, Scott Duke Kominers, Tim Roughgarden:
Shill-Proof Auctions. CoRR abs/2404.00475 (2024) - [i77]Eric Budish, Andrew Lewis-Pye, Tim Roughgarden:
The Economic Limits of Permissionless Consensus. CoRR abs/2405.09173 (2024) - [i76]William Brown, Christos H. Papadimitriou, Tim Roughgarden:
Online Stackelberg Optimization via Nonlinear Control. CoRR abs/2406.18805 (2024) - [i75]Naveen Durvasula, Tim Roughgarden:
Robust Restaking Networks. CoRR abs/2407.21785 (2024) - [i74]Jovan Komatovic, Joachim Neu, Tim Roughgarden:
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience. CoRR abs/2410.12755 (2024) - [i73]Hao Chung, Tim Roughgarden, Elaine Shi:
Collusion-Resilience in Transaction Fee Mechanism Design. IACR Cryptol. ePrint Arch. 2024: 237 (2024) - [i72]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Transaction Fee Mechanism Design in a Post-MEV World. IACR Cryptol. ePrint Arch. 2024: 331 (2024) - [i71]Jovan Komatovic, Joachim Neu, Tim Roughgarden:
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience. IACR Cryptol. ePrint Arch. 2024: 1682 (2024) - 2023
- [j80]Eric Neyman, Tim Roughgarden:
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. Oper. Res. 71(6): 2175-2195 (2023) - [c123]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
When Bidders Are DAOs. AFT 2023: 21:1-21:21 - [c122]Andrew Lewis-Pye, Tim Roughgarden:
Byzantine Generals in the Permissionless Setting. FC (1) 2023: 21-37 - [c121]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
Extended Abstract: The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers. FC Workshops 2023: 262-265 - [c120]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs. FC (1) 2023: 326-343 - [c119]Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden:
Formalizing Preferences Over Runtime Distributions. ICML 2023: 11659-11682 - [c118]Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden:
Utilitarian Algorithm Configuration. NeurIPS 2023 - [c117]Eric Neyman, Tim Roughgarden:
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling. NeurIPS 2023 - [i70]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
Complexity-Approximation Trade-offs in Exchange Mechanisms: AMMs vs. LOBs. CoRR abs/2302.11652 (2023) - [i69]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers. CoRR abs/2303.00208 (2023) - [i68]Andrew Lewis-Pye, Tim Roughgarden:
Permissionless Consensus. CoRR abs/2304.14701 (2023) - [i67]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
When Bidders Are DAOs. CoRR abs/2306.17099 (2023) - [i66]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Transaction Fee Mechanism Design with Active Block Producers. CoRR abs/2307.01686 (2023) - [i65]Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden:
Utilitarian Algorithm Configuration. CoRR abs/2310.20401 (2023) - 2022
- [c116]Eric Neyman, Tim Roughgarden:
Strictly Proper Contract Functions Can Be Arbitrage-Free. AAAI 2022: 5150-5155 - [c115]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden, Anthony Lee Zhang:
Quantifying Loss in Automated Market Makers. DeFi@CCS 2022: 71-74 - [c114]Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri:
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS 2022: 17:1-17:24 - [c113]Eric Neyman, Tim Roughgarden:
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals. EC 2022: 990-1012 - [i64]Eric Neyman, Tim Roughgarden:
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling. CoRR abs/2202.11219 (2022) - [i63]Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden:
Formalizing Preferences Over Runtime Distributions. CoRR abs/2205.13028 (2022) - 2021
- [j79]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. SIAM J. Comput. 50(1): 211-254 (2021) - [j78]Tim Roughgarden:
Transaction fee mechanism design. SIGecom Exch. 19(1): 52-55 (2021) - [c112]Andrew Lewis-Pye, Tim Roughgarden:
How Does Blockchain Security Dictate Blockchain Implementation? CCS 2021: 1006-1019 - [c111]Tim Roughgarden, Clara Shikhelman:
Ignore the Extra Zeroes: Variance-Optimal Mining Pools. Financial Cryptography (2) 2021: 233-249 - [c110]Nika Haghtalab, Tim Roughgarden, Abhishek Shetty:
Smoothed Analysis with Adaptive Adversaries. FOCS 2021: 942-953 - [c109]Eric Neyman, Tim Roughgarden:
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. EC 2021: 734 - [c108]Tim Roughgarden:
Transaction Fee Mechanism Design. EC 2021: 792 - [e7]Foteini Baldimtsi, Tim Roughgarden:
AFT '21: 3rd ACM Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26 - 28, 2021. ACM 2021, ISBN 978-1-4503-9082-8 [contents] - [i62]Eric Neyman, Tim Roughgarden:
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. CoRR abs/2102.07081 (2021) - [i61]Nika Haghtalab, Tim Roughgarden, Abhishek Shetty:
Smoothed Analysis with Adaptive Adversaries. CoRR abs/2102.08446 (2021) - [i60]Tim Roughgarden:
Transaction Fee Mechanism Design. CoRR abs/2106.01340 (2021) - [i59]Eric Neyman, Tim Roughgarden:
Strictly Proper Contract Functions Can Be Arbitrage-Free. CoRR abs/2109.01308 (2021) - [i58]Andrew Lewis-Pye, Tim Roughgarden:
How Does Blockchain Security Dictate Blockchain Implementation? CoRR abs/2109.04848 (2021) - [i57]Eric Neyman, Tim Roughgarden:
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals. CoRR abs/2111.03153 (2021) - 2020
- [j77]Rishi Gupta, Tim Roughgarden:
Data-driven algorithm design. Commun. ACM 63(6): 87-94 (2020) - [j76]Tim Roughgarden:
Complexity Theory, Game Theory, and Economics: The Barbados Lectures. Found. Trends Theor. Comput. Sci. 14(3-4): 222-407 (2020) - [j75]Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan:
Robust Auctions for Revenue via Enhanced Competition. Oper. Res. 68(4): 1074-1094 (2020) - [j74]Rad Niazadeh, Tim Roughgarden, Joshua R. Wang:
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. J. Mach. Learn. Res. 21: 125:1-125:31 (2020) - [j73]Benjamin Plaut, Tim Roughgarden:
Communication Complexity of Discrete Fair Division. SIAM J. Comput. 49(1): 206-243 (2020) - [j72]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. 49(2): 448-464 (2020) - [j71]Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. SIAM J. Discret. Math. 34(2): 1039-1068 (2020) - [j70]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Prior-free multi-unit auctions with ordered bidders. Theor. Comput. Sci. 846: 160-171 (2020) - [j69]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Multi-Unit Markets. ACM Trans. Economics and Comput. 7(4): 20:1-20:29 (2020) - [j68]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. ACM Trans. Economics and Comput. 8(1): 4:1-4:29 (2020) - [c107]Nika Haghtalab, Tim Roughgarden, Abhishek Shetty:
Smoothed Analysis of Online and Differentially Private Learning. NeurIPS 2020 - [c106]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. SODA 2020: 2688-2707 - [p4]Tim Roughgarden:
Introduction. Beyond the Worst-Case Analysis of Algorithms 2020: 1-24 - [p3]Tim Roughgarden:
Resource Augmentation. Beyond the Worst-Case Analysis of Algorithms 2020: 72-92 - [p2]Tim Roughgarden:
Distributional Analysis. Beyond the Worst-Case Analysis of Algorithms 2020: 167-188 - [p1]Tim Roughgarden, C. Seshadhri:
Distribution-Free Models of Social Networks. Beyond the Worst-Case Analysis of Algorithms 2020: 606-625 - [e6]Tim Roughgarden:
Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press 2020, ISBN 9781108637435 [contents] - [i56]Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. CoRR abs/2002.12034 (2020) - [i55]Nika Haghtalab, Tim Roughgarden, Abhishek Shetty:
Smoothed Analysis of Online and Differentially Private Learning. CoRR abs/2006.10129 (2020) - [i54]Andrew Lewis-Pye, Tim Roughgarden:
Resource Pools and the CAP Theorem. CoRR abs/2006.10698 (2020) - [i53]Yiling Chen, Arpita Ghosh, Michael Kearns, Tim Roughgarden, Jennifer Wortman Vaughan:
Mathematical Foundations for Social Computing. CoRR abs/2007.03661 (2020) - [i52]Edin Husic, Tim Roughgarden:
FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs. CoRR abs/2007.09768 (2020) - [i51]Tim Roughgarden:
Resource Augmentation. CoRR abs/2007.13234 (2020) - [i50]Tim Roughgarden:
Distributional Analysis. CoRR abs/2007.13240 (2020) - [i49]Tim Roughgarden:
Beyond the Worst-Case Analysis of Algorithms (Introduction). CoRR abs/2007.13241 (2020) - [i48]Tim Roughgarden, C. Seshadhri:
Distribution-Free Models of Social Networks. CoRR abs/2007.15743 (2020) - [i47]Tim Roughgarden:
Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559. CoRR abs/2012.00854 (2020) - no results
2010 – 2019
- 2019
- [j67]Tim Roughgarden:
Beyond worst-case analysis. Commun. ACM 62(3): 88-96 (2019) - [j66]Nikhil R. Devanur, Jason D. Hartline, Tim Roughgarden:
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2012. Games Econ. Behav. 113: 1-3 (2019) - [j65]Tim Roughgarden, Joshua R. Wang:
Minimizing Regret with Multiple Reserves. ACM Trans. Economics and Comput. 7(3): 17:1-17:18 (2019) - [c105]Xi Chen, Christos H. Papadimitriou, Tim Roughgarden:
An Axiomatic Approach to Block Rewards. AFT 2019: 124-131 - [c104]Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang:
On the Computational Power of Online Gradient Descent. COLT 2019: 624-662 - [c103]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Simple versus Optimal Contracts. EC 2019: 369-387 - [c102]Tim Roughgarden:
How Computer Science Informs Modern Auction Design (Invited Talk). FSTTCS 2019: 5:1-5:1 - [c101]Benjamin Plaut, Tim Roughgarden:
Communication Complexity of Discrete Fair Division. SODA 2019: 2014-2033 - [i46]Xi Chen, Christos H. Papadimitriou, Tim Roughgarden:
An Axiomatic Approach to Block Rewards. CoRR abs/1909.10645 (2019) - 2018
- [j64]Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Is Shapley cost sharing optimal? Games Econ. Behav. 108: 130-138 (2018) - [j63]Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang:
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation). J. ACM 65(6): 41:1-41:24 (2018) - [j62]Zhiyi Huang, Yishay Mansour, Tim Roughgarden:
Making the Most of Your Samples. SIAM J. Comput. 47(3): 651-674 (2018) - [j61]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public Projects, Boolean Functions, and the Borders of Border's Theorem. ACM Trans. Economics and Comput. 6(3-4): 18:1-18:21 (2018) - [c100]Tim Roughgarden, Joshua R. Wang:
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. COLT 2018: 1307-1325 - [c99]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP 2018: 55:1-55:15 - [c98]Rad Niazadeh, Tim Roughgarden, Joshua R. Wang:
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. NeurIPS 2018: 9617-9627 - [c97]Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. SODA 2018: 2584-2603 - [c96]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Multi-unit Markets. WINE 2018: 140-153 - [i45]Tim Roughgarden:
Complexity Theory, Game Theory, and Economics. CoRR abs/1801.00734 (2018) - [i44]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR abs/1804.07431 (2018) - [i43]George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden:
The idemetric property: when most distances are (almost) the same. CoRR abs/1804.11187 (2018) - [i42]Rad Niazadeh, Tim Roughgarden, Joshua R. Wang:
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. CoRR abs/1805.09480 (2018) - [i41]Tim Roughgarden, Joshua R. Wang:
An Optimal Algorithm for Online Unconstrained Submodular Maximization. CoRR abs/1806.03349 (2018) - [i40]Tim Roughgarden:
Beyond Worst-Case Analysis. CoRR abs/1806.09817 (2018) - [i39]Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang:
On the Computational Power of Online Gradient Descent. CoRR abs/1807.01280 (2018) - [i38]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Simple versus Optimal Contracts. CoRR abs/1808.03713 (2018) - [i37]Tim Roughgarden, Inbal Talgam-Cohen:
Approximately Optimal Mechanism Design. CoRR abs/1812.11896 (2018) - [i36]Tim Roughgarden:
Complexity Theory, Game Theory, and Economics. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j60]Tim Roughgarden, Kazuo Iwama:
Twenty Lectures on Algorithmic Game Theory. Bull. EATCS 122 (2017) - [j59]Paul Dütting, Inbal Talgam-Cohen, Tim Roughgarden:
Modularity and greed in double auctions. Games Econ. Behav. 105: 59-83 (2017) - [j58]Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos:
The Price of Anarchy in Auctions. J. Artif. Intell. Res. 59: 59-101 (2017) - [j57]Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden:
The Performance of Deferred-Acceptance Auctions. Math. Oper. Res. 42(4): 897-914 (2017) - [j56]Rishi Gupta, Tim Roughgarden:
A PAC Approach to Application-Specific Algorithm Selection. SIAM J. Comput. 46(3): 992-1017 (2017) - [c95]Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák:
When Are Welfare Guarantees Robust?. APPROX-RANDOM 2017: 22:1-22:23 - [c94]Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. ESA 2017: 26:1-26:15 - [c93]Tim Roughgarden, Okke Schrijvers:
Online Prediction with Selfish Experts. NIPS 2017: 1300-1310 - [c92]Vasilis Gkatzelis, Evangelos Markakis, Tim Roughgarden:
Deferred-Acceptance Auctions for Multiple Levels of Service. EC 2017: 21-38 - [c91]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. EC 2017: 591-608 - [c90]Tim Roughgarden, Inbal Talgam-Cohen:
Why prices need algorithms (invited talk). STOC 2017: 2 - [i35]Tim Roughgarden, Okke Schrijvers:
Online Prediction with Selfish Experts. CoRR abs/1702.03615 (2017) - [i34]Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. CoRR abs/1705.00127 (2017) - [i33]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Identical Items. CoRR abs/1705.06623 (2017) - [i32]Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. CoRR abs/1707.04769 (2017) - [i31]Benjamin Plaut, Tim Roughgarden:
Communication Complexity of Discrete Fair Division. CoRR abs/1711.04066 (2017) - 2016
- [j55]Yiling Chen, Arpita Ghosh, Michael J. Kearns, Tim Roughgarden, Jennifer Wortman Vaughan:
Mathematical foundations for social computing. Commun. ACM 59(12): 102-108 (2016) - [j54]Tim Roughgarden:
Communication Complexity (for Algorithm Designers). Found. Trends Theor. Comput. Sci. 11(3-4): 217-404 (2016) - [j53]Vasilis Gkatzelis, Konstantinos Kollias, Tim Roughgarden:
Optimal Cost-Sharing in General Resource Selection Games. Oper. Res. 64(6): 1230-1238 (2016) - [j52]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. J. ACM 63(4): 30:1-30:33 (2016) - [j51]Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of Triangle-Dense Graphs. SIAM J. Comput. 45(2): 197-215 (2016) - [j50]Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu:
Private Matchings and Allocations. SIAM J. Comput. 45(6): 1953-1984 (2016) - [j49]Tim Roughgarden, Okke Schrijvers:
Network Cost-Sharing without Anonymity. ACM Trans. Economics and Comput. 4(2): 8:1-8:24 (2016) - [j48]Tim Roughgarden, Inbal Talgam-Cohen:
Optimal and Robust Mechanism Design with Interdependent Values. ACM Trans. Economics and Comput. 4(3): 18:1-18:34 (2016) - [c89]Jamie Morgenstern, Tim Roughgarden:
Learning Simple Auctions. COLT 2016: 1298-1318 - [c88]Tim Roughgarden, Joshua R. Wang:
The Complexity of the k-means Method. ESA 2016: 78:1-78:14 - [c87]Okke Schrijvers, Joseph Bonneau, Dan Boneh, Tim Roughgarden:
Incentive Compatibility of Bitcoin Mining Pool Reward Functions. Financial Cryptography 2016: 477-498 - [c86]Tim Roughgarden, Omri Weinstein:
On the Communication Complexity of Approximate Fixed Points. FOCS 2016: 229-238 - [c85]Tim Roughgarden, Inbal Talgam-Cohen:
Why Prices Need Algorithms. IJCAI 2016: 4210-4212 - [c84]Rishi Gupta, Tim Roughgarden:
A PAC Approach to Application-Specific Algorithm Selection. ITCS 2016: 123-134 - [c83]Tim Roughgarden, Okke Schrijvers:
Ironing in the Dark. EC 2016: 1-18 - [c82]Tim Roughgarden:
Intrinsic Robustness of the Price of Anarchy: Abstract of the Kalai Prize Talk. EC 2016: 457 - [c81]Tim Roughgarden, Joshua R. Wang:
Minimizing Regret with Multiple Reserves. EC 2016: 601-616 - [c80]Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang:
Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). SPAA 2016: 1-12 - [c79]Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis:
The price of anarchy in large games. STOC 2016: 963-976 - [i30]Jamie Morgenstern, Tim Roughgarden:
Learning Simple Auctions. CoRR abs/1604.03171 (2016) - [i29]Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos:
The Price of Anarchy in Auctions. CoRR abs/1607.07684 (2016) - [i28]Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák:
When Are Welfare Guarantees Robust? CoRR abs/1608.02402 (2016) - [i27]Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta:
Approximately Efficient Two-Sided Combinatorial Auctions. CoRR abs/1611.05342 (2016) - [i26]Tim Roughgarden, Omri Weinstein:
On the Communication Complexity of Approximate Fixed Points. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j47]Yan Chen, Tim Roughgarden:
Special Section of Games and Economic Behavior dedicated to the 11th and 12th ACM Conference on Electronic Commerce. Games Econ. Behav. 91: 283 (2015) - [j46]Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan:
Revenue maximization with a single sample. Games Econ. Behav. 91: 318-333 (2015) - [j45]Shuchi Chawla, Lisa Fleischer, Jason D. Hartline, Tim Roughgarden:
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011. Games Econ. Behav. 92: 228-231 (2015) - [j44]Tim Roughgarden:
Intrinsic Robustness of the Price of Anarchy. J. ACM 62(5): 32:1-32:42 (2015) - [j43]Tim Roughgarden, Florian Schoppmann:
Local smoothness and the price of anarchy in splittable congestion games. J. Econ. Theory 156: 317-342 (2015) - [j42]Tim Roughgarden:
Special Section on the Fifty-Third IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012). SIAM J. Comput. 44(5): 1286 (2015) - [j41]Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma:
Preventing Unraveling in Social Networks: The Anchored k-Core Problem. SIAM J. Discret. Math. 29(3): 1452-1475 (2015) - [j40]Tim Roughgarden, Inbal Talgam-Cohen:
Why prices need algorithms. SIGecom Exch. 14(2): 35-40 (2015) - [j39]Tim Roughgarden:
The Price of Anarchy in Games of Incomplete Information. ACM Trans. Economics and Comput. 3(1): 6:1-6:20 (2015) - [j38]Konstantinos Kollias, Tim Roughgarden:
Restoring Pure Equilibria to Weighted Congestion Games. ACM Trans. Economics and Comput. 3(4): 21:1-21:24 (2015) - [c78]Amir Globerson, Tim Roughgarden, David A. Sontag, Cafer Yildirim:
How Hard is Inference for Structured Prediction? ICML 2015: 2181-2190 - [c77]Jamie Morgenstern, Tim Roughgarden:
On the Pseudo-Dimension of Nearly Optimal Auctions. NIPS 2015: 136-144 - [c76]Tim Roughgarden, Inbal Talgam-Cohen:
Why Prices Need Algorithms. EC 2015: 19-36 - [c75]Zhiyi Huang, Yishay Mansour, Tim Roughgarden:
Making the Most of Your Samples. EC 2015: 45-60 - [c74]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public Projects, Boolean Functions, and the Borders of Border's Theorem. EC 2015: 395 - [e5]Tim Roughgarden:
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015. ACM 2015, ISBN 978-1-4503-3333-7 [contents] - [e4]Tim Roughgarden, Michal Feldman, Michael Schwarz:
Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15-19, 2015. ACM 2015, ISBN 978-1-4503-3410-5 [contents] - [i25]Richard Cole, Tim Roughgarden:
The Sample Complexity of Revenue Maximization. CoRR abs/1502.00963 (2015) - [i24]Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis:
The Price of Anarchy in Large Games. CoRR abs/1503.04755 (2015) - [i23]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public projects, Boolean functions and the borders of Border's theorem. CoRR abs/1504.07687 (2015) - [i22]Jamie Morgenstern, Tim Roughgarden:
The Pseudo-Dimension of Near-Optimal Auctions. CoRR abs/1506.03684 (2015) - [i21]Tim Roughgarden:
Communication Complexity (for Algorithm Designers). CoRR abs/1509.06257 (2015) - [i20]Tim Roughgarden, Okke Schrijvers:
Ironing in the Dark. CoRR abs/1511.06918 (2015) - [i19]Rishi Gupta, Tim Roughgarden:
A PAC Approach to Application-Specific Algorithm Selection. CoRR abs/1511.07147 (2015) - [i18]Tim Roughgarden:
Computing Equilibria: A Computational Complexity Perspective. Electron. Colloquium Comput. Complex. TR15 (2015) - [i17]Tim Roughgarden:
Communication Complexity (for Algorithm Designers). Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j37]Shaddin Dughmi, Tim Roughgarden:
Black-Box Randomized Reductions in Algorithmic Mechanism Design. SIAM J. Comput. 43(1): 312-336 (2014) - [j36]Tim Roughgarden:
Approximately optimal mechanism design: motivation, examples, and lessons learned. SIGecom Exch. 13(2): 4-20 (2014) - [j35]Jason R. Marden, Tim Roughgarden:
Generalized Efficiency Bounds in Distributed Resource Allocation. IEEE Trans. Autom. Control. 59(3): 571-584 (2014) - [j34]Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden:
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness. ACM Trans. Economics and Comput. 2(4): 14:1-14:23 (2014) - [c73]Tim Roughgarden:
Barriers to Near-Optimal Equilibria. FOCS 2014: 71-80 - [c72]Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan R. Ullman:
Privately Solving Linear Programs. ICALP (1) 2014: 612-624 - [c71]Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of triangle-dense graphs. ITCS 2014: 471-482 - [c70]Tim Roughgarden, Okke Schrijvers:
Network Cost-Sharing without Anonymity. SAGT 2014: 134-145 - [c69]Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden:
The performance of deferred-acceptance auctions. EC 2014: 187-204 - [c68]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Modularity and greed in double auctions. EC 2014: 241-258 - [c67]Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu:
Private matchings and allocations. STOC 2014: 21-30 - [c66]Richard Cole, Tim Roughgarden:
The sample complexity of revenue maximization. STOC 2014: 243-252 - [c65]Vasilis Gkatzelis, Konstantinos Kollias, Tim Roughgarden:
Optimal Cost-Sharing in Weighted Congestion Games. WINE 2014: 72-88 - [i16]Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan R. Ullman:
Privately Solving Linear Programs. CoRR abs/1402.3631 (2014) - [i15]Tim Roughgarden:
Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned. CoRR abs/1406.6773 (2014) - [i14]Zhiyi Huang, Yishay Mansour, Tim Roughgarden:
Making the Most of Your Samples. CoRR abs/1407.2479 (2014) - [i13]Amir Globerson, Tim Roughgarden, David A. Sontag, Cafer Yildirim:
Tight Error Bounds for Structured Prediction. CoRR abs/1409.5834 (2014) - [i12]Jason D. Hartline, Tim Roughgarden:
Optimal Platform Design. CoRR abs/1412.8518 (2014) - [i11]Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden:
Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372). Dagstuhl Reports 4(9): 30-49 (2014) - 2013
- [c64]Tim Roughgarden, Michael J. Kearns:
Marginals-to-Models Reducibility. NIPS 2013: 1043-1051 - [c63]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu:
Near-optimal multi-unit auctions with ordered bidders. EC 2013: 91-102 - [c62]Tim Roughgarden, Inbal Talgam-Cohen:
Optimal and near-optimal mechanism design with interdependent values. EC 2013: 767-784 - [e3]Dan Boneh, Tim Roughgarden, Joan Feigenbaum:
Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. ACM 2013, ISBN 978-1-4503-2029-0 [contents] - [i10]Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of Triangle-Dense Graphs. CoRR abs/1309.7440 (2013) - [i9]Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu:
Private Matchings and Allocations. CoRR abs/1311.2828 (2013) - 2012
- [j33]Tim Roughgarden:
Intrinsic robustness of the price of anarchy. Commun. ACM 55(7): 116-123 (2012) - [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 Exch. 11(1): 18-20 (2012) - [j29]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue Submodularity. Theory Comput. 8(1): 95-119 (2012) - [c61]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 - [c60]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden:
Combinatorial auctions with restricted complements. EC 2012: 3-16 - [c59]Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan:
Supply-limiting mechanisms. EC 2012: 844-861 - [c58]Tim Roughgarden:
The price of anarchy in games of incomplete information. EC 2012: 862-879 - [c57]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden:
Sketching valuation functions. SODA 2012: 1025-1035 - [c56]Stefano Leonardi, Tim Roughgarden:
Prior-free auctions with ordered bidders. STOC 2012: 427-434 - [c55]Kshipra Bhawalkar, Tim Roughgarden:
Simultaneous Single-Item Auctions. WINE 2012: 337-349 - [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. Discret. Math. 25(4): 1667-1686 (2011) - [j26]Robert Krauthgamer, Tim Roughgarden:
Metric Clustering via Consistent Labeling. Theory Comput. 7(1): 49-74 (2011) - [c54]Uri Nadav, Ramesh Johari, Tim Roughgarden:
Uncoupled potentials for proportional allocation markets. CDC/ECC 2011: 4479-4484 - [c53]Konstantinos Kollias, Tim Roughgarden:
Restoring Pure Equilibria to Weighted Congestion Games. ICALP (2) 2011: 539-551 - [c52]Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer:
Flexible Tree Matching. IJCAI 2011: 2674-2679 - [c51]Tim Roughgarden, Florian Schoppmann:
Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. SODA 2011: 255-267 - [c50]Kshipra Bhawalkar, Tim Roughgarden:
Welfare Guarantees for Combinatorial Auctions with Item Bidding. SODA 2011: 700-709 - [c49]Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. STOC 2011: 149-158 - [e2]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, ISBN 978-1-4503-0261-6 [contents] - [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]Tim Roughgarden:
Algorithmic game theory. Commun. ACM 53(7): 78-86 (2010) - [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 J. Optim. 20(6): 3260-3279 (2010) - [c48]Shaddin Dughmi, Tim Roughgarden:
Truthfulness via smoothed complexity. BQGT 2010: 21:1 - [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. EC 2010: 129-138 - [c43]Aaron Roth, Tim Roughgarden:
Interactive privacy via the median mechanism. STOC 2010: 765-774 - [c42]Uri Nadav, Tim Roughgarden:
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds. WINE 2010: 319-326 - no results
2000 – 2009
- 2009
- [j21]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Beyond Moulin mechanisms. Games Econ. Behav. 67(1): 125-155 (2009) - [j20]Tim Roughgarden, Mukund Sundararajan:
Quantifying inefficiency in cost-sharing mechanisms. J. ACM 56(4): 23:1-23:33 (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 Exch. 8(1) (2009) - [j17]Jason D. Hartline, Tim Roughgarden:
Simple versus optimal mechanisms. SIGecom Exch. 8(1) (2009) - [c41]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue Submodularity. AMMA 2009: 89-91 - [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. EC 2009: 225-234 - [c37]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue submodularity. EC 2009: 243-252 - [c36]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan:
Universally utility-maximizing privacy mechanisms. STOC 2009: 351-360 - [c35]Tim Roughgarden:
Intrinsic robustness of the price of anarchy. STOC 2009: 513-522 - [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): 14:1-14:29 (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]Shuchi Chawla, Tim Roughgarden:
Bertrand Competition in Networks. SAGT 2008: 70-82 - [c31]Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Is Shapley Cost Sharing Optimal? SAGT 2008: 327-336 - [c30]Robert Krauthgamer, Tim Roughgarden:
Metric clustering via consistent labeling. SODA 2008: 809-818 - [c29]Ho-Lin Chen, Tim Roughgarden, Gregory Valiant:
Designing networks with good equilibria. SODA 2008: 854-863 - [c28]Jason D. Hartline, Tim Roughgarden:
Optimal mechanism design and money burning. STOC 2008: 75-84 - [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 J. Sel. Areas Commun. 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. EC 2007: 1-10 - [c25]Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah:
Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493 - [e1]Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani:
Algorithmic Game Theory. Cambridge University Press 2007, ISBN 9780511800481 - 2006
- [j11]Mitul Saha, Tim Roughgarden, Jean-Claude Latombe, Gildardo Sánchez-Ante:
Planning Tours of Robotic Arms among Partitioned Goals. Int. J. Robotics 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]Shuchi Chawla, Tim Roughgarden:
Single-Source Stochastic Routing. APPROX-RANDOM 2006: 82-94 - [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. EC 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]Ho-Lin Chen, Tim Roughgarden:
Network design with weighted players. SPAA 2006: 29-38 - [c19]Tim Roughgarden, Mukund Sundararajan:
New trade-offs in cost-sharing mechanisms. STOC 2006: 79-88 - [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
- [b2]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. Comput. Commun. Rev. 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]Tim Roughgarden:
Selfish routing with atomic players. SODA 2005: 1184-1185 - 2004
- [j6]Tim Roughgarden, Éva Tardos:
Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econ. Behav. 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]Tim Roughgarden:
Stackelberg Scheduling Strategies. SIAM J. Comput. 33(2): 332-350 (2004) - [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]Henry C. Lin, Tim Roughgarden, Éva Tardos:
A stronger bound on Braess's Paradox. SODA 2004: 340-341 - [c12]Tim Roughgarden:
The maximum latency of selfish routing. SODA 2004: 980-981 - 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? EC 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
- [b1]Tim Roughgarden:
Selfish Routing. Cornell University, USA, 2002 - [j2]Alan J. Hoffman, Kate Jenkins, Tim Roughgarden:
On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002) - [j1]Tim Roughgarden, Éva Tardos:
How bad is selfish routing? J. ACM 49(2): 236-259 (2002) - [c7]Amit Kumar, Anupam Gupta, Tim Roughgarden:
A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333- - [c6]Tim Roughgarden:
How unfair is optimal routing? SODA 2002: 203-204 - [c5]Tim Roughgarden:
The price of anarchy is independent of the network topology. STOC 2002: 428-437 - 2001
- [c4]Tim Roughgarden:
Designing Networks for Selfish Users is Hard. FOCS 2001: 472-481 - [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]Tim Roughgarden:
Stackelberg scheduling strategies. STOC 2001: 104-113 - 2000
- [c1]Tim Roughgarden, Éva Tardos:
How Bad is Selfish Routing? FOCS 2000: 93-102 - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
