Tim Roughgarden

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 163

Top Venues

CoRR

SIAM J. Comput.

ACM Trans. Economics and Comput.

Publications

Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
Centralization in Block Building and Proposer-Builder Separation. CoRR (2024)
Andrew Komo, Scott Duke Kominers, Tim Roughgarden
Shill-Proof Auctions. CoRR (2024)
William Brown, Christos H. Papadimitriou, Tim Roughgarden
Online Stackelberg Optimization via Nonlinear Control. CoRR (2024)
William Brown, Christos H. Papadimitriou, Tim Roughgarden
Online Stackelberg Optimization via Nonlinear Control. COLT (2024)
Tim Roughgarden
The Computer in the Sky (Keynote). STOC (2024)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis with Adaptive Adversaries. J. ACM 71 (3) (2024)
Hao Chung, Tim Roughgarden, Elaine Shi
Collusion-Resilience in Transaction Fee Mechanism Design. IACR Cryptol. ePrint Arch. 2024 (2024)
Tim Roughgarden
Transaction Fee Mechanism Design. J. ACM 71 (4) (2024)
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
Transaction Fee Mechanism Design in a Post-MEV World. IACR Cryptol. ePrint Arch. 2024 (2024)
Eric Budish, Andrew Lewis-Pye, Tim Roughgarden
The Economic Limits of Permissionless Consensus. CoRR (2024)
Naveen Durvasula, Tim Roughgarden
Robust Restaking Networks. CoRR (2024)
Tim Roughgarden
Keynote: Provable Slashing Guarantees. PODC (2024)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers. ITCS (2024)
Hao Chung, Tim Roughgarden, Elaine Shi
Collusion-Resilience in Transaction Fee Mechanism Design. CoRR (2024)
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
Utilitarian Algorithm Configuration. NeurIPS (2023)
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
Transaction Fee Mechanism Design with Active Block Producers. CoRR (2023)
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
When Bidders Are DAOs. AFT (2023)
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
Utilitarian Algorithm Configuration. CoRR (2023)
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
Formalizing Preferences Over Runtime Distributions. ICML (2023)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers. CoRR (2023)
Eric Neyman, Tim Roughgarden
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling. NeurIPS (2023)
Andrew Lewis-Pye, Tim Roughgarden
Byzantine Generals in the Permissionless Setting. FC (1) (2023)
Eric Neyman, Tim Roughgarden
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. Oper. Res. 71 (6) (2023)
Andrew Lewis-Pye, Tim Roughgarden
Permissionless Consensus. CoRR (2023)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
Extended Abstract: The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers. FC Workshops (2023)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs. FC (1) (2023)
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
When Bidders Are DAOs. CoRR (2023)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
Complexity-Approximation Trade-offs in Exchange Mechanisms: AMMs vs. LOBs. CoRR (2023)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden, Anthony Lee Zhang
Quantifying Loss in Automated Market Makers. DeFi@CCS (2022)
Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. ITCS (2022)
Eric Neyman, Tim Roughgarden
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling. CoRR (2022)
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
Formalizing Preferences Over Runtime Distributions. CoRR (2022)
Eric Neyman, Tim Roughgarden
Strictly Proper Contract Functions Can Be Arbitrage-Free. AAAI (2022)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis with Adaptive Adversaries. FOCS (2022)
Eric Neyman, Tim Roughgarden
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals. EC (2022)
Tim Roughgarden
Transaction Fee Mechanism Design. EC (2021)
Eric Neyman, Tim Roughgarden
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals. CoRR (2021)
Andrew Lewis-Pye, Tim Roughgarden
How Does Blockchain Security Dictate Blockchain Implementation? CCS (2021)
Tim Roughgarden, Clara Shikhelman
Ignore the Extra Zeroes: Variance-Optimal Mining Pools. Financial Cryptography (2) (2021)
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
The Complexity of Contracts. SIAM J. Comput. 50 (1) (2021)
Tim Roughgarden
Transaction Fee Mechanism Design. CoRR (2021)
Eric Neyman, Tim Roughgarden
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. CoRR (2021)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis with Adaptive Adversaries. CoRR (2021)
Eric Neyman, Tim Roughgarden
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. EC (2021)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis with Adaptive Adversaries. FOCS (2021)
Tim Roughgarden
Transaction fee mechanism design. SIGecom Exch. 19 (1) (2021)
Andrew Lewis-Pye, Tim Roughgarden
How Does Blockchain Security Dictate Blockchain Implementation? CoRR (2021)
Eric Neyman, Tim Roughgarden
Strictly Proper Contract Functions Can Be Arbitrage-Free. CoRR (2021)
Benjamin Plaut, Tim Roughgarden
Communication Complexity of Discrete Fair Division. SIAM J. Comput. 49 (1) (2020)
Edin Husic, Tim Roughgarden
FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs. CoRR (2020)
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) (2020)
Yiling Chen, Arpita Ghosh, Michael Kearns, Tim Roughgarden, Jennifer Wortman Vaughan
Mathematical Foundations for Social Computing. CoRR (2020)
Benjamin Plaut, Tim Roughgarden
Almost Envy-Freeness with General Valuations. SIAM J. Discret. Math. 34 (2) (2020)
Rishi Gupta, Tim Roughgarden
Data-driven algorithm design. Commun. ACM 63 (6) (2020)
Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen
The Complexity of Contracts. CoRR (2020)
Tim Roughgarden
Complexity Theory, Game Theory, and Economics: The Barbados Lectures. Found. Trends Theor. Comput. Sci. 14 (3-4) (2020)
Andrew Lewis-Pye, Tim Roughgarden
Resource Pools and the CAP Theorem. CoRR (2020)
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
The Complexity of Contracts. SODA (2020)
Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong
Pricing Multi-Unit Markets. ACM Trans. Economics and Comput. 7 (4) (2020)
Tim Roughgarden
Beyond the Worst-Case Analysis of Algorithms (Introduction). CoRR (2020)
Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan
Robust Auctions for Revenue via Enhanced Competition. Oper. Res. 68 (4) (2020)
Andrew Lewis-Pye, Tim Roughgarden
A General Framework for the Security Analysis of Blockchain Protocols. CoRR (2020)
Tim Roughgarden
Resource Augmentation. CoRR (2020)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis of Online and Differentially Private Learning. CoRR (2020)
Tim Roughgarden
Distributional Analysis. CoRR (2020)
Tim Roughgarden, C. Seshadhri
Distribution-Free Models of Social Networks. CoRR (2020)
Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu
Prior-free multi-unit auctions with ordered bidders. Theor. Comput. Sci. 846 (2020)
Tim Roughgarden
Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559. CoRR (2020)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis of Online and Differentially Private Learning. NeurIPS (2020)
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) (2020)
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. J. Mach. Learn. Res. 21 (2020)
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
Simple versus Optimal Contracts. EC (2019)
Tim Roughgarden
How Computer Science Informs Modern Auction Design (Invited Talk). FSTTCS (2019)
Tim Roughgarden, Joshua R. Wang
Minimizing Regret with Multiple Reserves. ACM Trans. Economics and Comput. 7 (3) (2019)
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
On the Computational Power of Online Gradient Descent. COLT (2019)
Tim Roughgarden
Beyond worst-case analysis. Commun. ACM 62 (3) (2019)
Nikhil R. Devanur, Jason D. Hartline, Tim Roughgarden
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2012. Games Econ. Behav. 113 (2019)
Xi Chen, Christos H. Papadimitriou, Tim Roughgarden
An Axiomatic Approach to Block Rewards. CoRR (2019)
Xi Chen, Christos H. Papadimitriou, Tim Roughgarden
An Axiomatic Approach to Block Rewards. AFT (2019)
Benjamin Plaut, Tim Roughgarden
Communication Complexity of Discrete Fair Division. SODA (2019)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR (2018)
Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong
Pricing Multi-unit Markets. WINE (2018)
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) (2018)
Tim Roughgarden, Joshua R. Wang
An Optimal Algorithm for Online Unconstrained Submodular Maximization. CoRR (2018)
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
On the Computational Power of Online Gradient Descent. CoRR (2018)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP (2018)
Tim Roughgarden
Beyond Worst-Case Analysis. CoRR (2018)
Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
Is Shapley cost sharing optimal? Games Econ. Behav. 108 (2018)
Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation). J. ACM 65 (6) (2018)
Benjamin Plaut, Tim Roughgarden
Almost Envy-Freeness with General Valuations. SODA (2018)
Tim Roughgarden, Inbal Talgam-Cohen
Approximately Optimal Mechanism Design. CoRR (2018)
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 (2018)
Zhiyi Huang, Yishay Mansour, Tim Roughgarden
Making the Most of Your Samples. SIAM J. Comput. 47 (3) (2018)
Tim Roughgarden, Joshua R. Wang
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. COLT (2018)
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. NeurIPS (2018)
Tim Roughgarden
Complexity Theory, Game Theory, and Economics. Electron. Colloquium Comput. Complex. 25 (2018)
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
Simple versus Optimal Contracts. CoRR (2018)
Tim Roughgarden
Complexity Theory, Game Theory, and Economics. CoRR (2018)
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. CoRR (2018)
Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos
The Price of Anarchy in Auctions. J. Artif. Intell. Res. 59 (2017)

Tim Roughgarden.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tim Roughgarden