default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy Roughgarden
Tim Roughgarden
Person information
- affiliation: Columbia University, New York, NY, USA
- affiliation (former): Stanford University, USA
- award (2012): Gödel Prize
- award (2009): Grace Murray Hopper Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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) - [c128]Maryam Bahrani, Pranav Garimidi, Tim Roughgarden:
Transaction Fee Mechanism Design in a Post-MEV World. AFT 2024: 29:1-29:24 - [c127]William Brown, Christos H. Papadimitriou, Tim Roughgarden:
Online Stackelberg Optimization via Nonlinear Control. COLT 2024: 697-749 - [c126]Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden:
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers. ITCS 2024: 81:1-81:19 - [c125]Tim Roughgarden:
Keynote: Provable Slashing Guarantees. PODC 2024: 2 - [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)
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: