Timothy Roughgarden

Orcid: 0000-0002-7163-8306

Affiliations:
  • Columbia University, New York, NY, USA
  • Stanford University, USA (former)


According to our database1, Timothy Roughgarden authored at least 197 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2023, "For contributions to algorithmic game theory".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Transaction Fee Mechanism Design.
J. ACM, August, 2024

Smoothed Analysis with Adaptive Adversaries.
J. ACM, June, 2024

Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience.
IACR Cryptol. ePrint Arch., 2024

Collusion-Resilience in Transaction Fee Mechanism Design.
IACR Cryptol. ePrint Arch., 2024

Transaction Fee Mechanism Design in a Post-MEV World.
IACR Cryptol. ePrint Arch., 2024

Robust Restaking Networks.
CoRR, 2024

The Economic Limits of Permissionless Consensus.
CoRR, 2024

Shill-Proof Auctions.
CoRR, 2024

Centralization in Block Building and Proposer-Builder Separation.
CoRR, 2024

The Computer in the Sky (Keynote).
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Keynote: Provable Slashing Guarantees.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Online Stackelberg Optimization via Nonlinear Control.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.
Oper. Res., 2023

Transaction Fee Mechanism Design with Active Block Producers.
CoRR, 2023

Permissionless Consensus.
CoRR, 2023

No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Utilitarian Algorithm Configuration.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Formalizing Preferences Over Runtime Distributions.
Proceedings of the International Conference on Machine Learning, 2023

Extended Abstract: The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers.
Proceedings of the Financial Cryptography and Data Security. FC 2023 International Workshops, 2023

Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs.
Proceedings of the Financial Cryptography and Data Security, 2023

Byzantine Generals in the Permissionless Setting.
Proceedings of the Financial Cryptography and Data Security, 2023

When Bidders Are DAOs.
Proceedings of the 5th Conference on Advances in Financial Technologies, 2023

2022
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

FPT Algorithms for Finding Near-Cliques in c-Closed Graphs.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Quantifying Loss in Automated Market Makers.
Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and Security, 2022

Strictly Proper Contract Functions Can Be Arbitrage-Free.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
The Complexity of Contracts.
SIAM J. Comput., 2021

Ignore the Extra Zeroes: Variance-Optimal Mining Pools.
Proceedings of the Financial Cryptography and Data Security, 2021

How Does Blockchain Security Dictate Blockchain Implementation?
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Pricing Multi-Unit Markets.
ACM Trans. Economics and Comput., 2020

Approximately Efficient Two-Sided Combinatorial Auctions.
ACM Trans. Economics and Comput., 2020

Prior-free multi-unit auctions with ordered bidders.
Theor. Comput. Sci., 2020

Almost Envy-Freeness with General Valuations.
SIAM J. Discret. Math., 2020

Communication Complexity of Discrete Fair Division.
SIAM J. Comput., 2020

Finding Cliques in Social Networks: A New Distribution-Free Model.
SIAM J. Comput., 2020

Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.
J. Mach. Learn. Res., 2020

Robust Auctions for Revenue via Enhanced Competition.
Oper. Res., 2020

Complexity Theory, Game Theory, and Economics: The Barbados Lectures.
Found. Trends Theor. Comput. Sci., 2020

Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559.
CoRR, 2020

Distribution-Free Models of Social Networks.
CoRR, 2020

Beyond the Worst-Case Analysis of Algorithms (Introduction).
CoRR, 2020

Distributional Analysis.
CoRR, 2020

Resource Augmentation.
CoRR, 2020

FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs.
CoRR, 2020

Resource Pools and the CAP Theorem.
CoRR, 2020

Data-driven algorithm design.
Commun. ACM, 2020

Smoothed Analysis of Online and Differentially Private Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Distribution-Free Models of Social Networks.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

Distributional Analysis.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

Resource Augmentation.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

Introduction.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019
Minimizing Regret with Multiple Reserves.
ACM Trans. Economics and Comput., 2019

Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2012.
Games Econ. Behav., 2019

Beyond worst-case analysis.
Commun. ACM, 2019

How Computer Science Informs Modern Auction Design (Invited Talk).
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Simple versus Optimal Contracts.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

On the Computational Power of Online Gradient Descent.
Proceedings of the Conference on Learning Theory, 2019

An Axiomatic Approach to Block Rewards.
Proceedings of the 1st ACM Conference on Advances in Financial Technologies, 2019

2018
Public Projects, Boolean Functions, and the Borders of Border's Theorem.
ACM Trans. Economics and Comput., 2018

Making the Most of Your Samples.
SIAM J. Comput., 2018

Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation).
J. ACM, 2018

Is Shapley cost sharing optimal?
Games Econ. Behav., 2018

Complexity Theory, Game Theory, and Economics.
Electron. Colloquium Comput. Complex., 2018

Approximately Optimal Mechanism Design.
CoRR, 2018

An Optimal Algorithm for Online Unconstrained Submodular Maximization.
CoRR, 2018

The idemetric property: when most distances are (almost) the same.
CoRR, 2018

An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization.
Proceedings of the Conference On Learning Theory, 2018

2017
A PAC Approach to Application-Specific Algorithm Selection.
SIAM J. Comput., 2017

The Performance of Deferred-Acceptance Auctions.
Math. Oper. Res., 2017

The Price of Anarchy in Auctions.
J. Artif. Intell. Res., 2017

Modularity and greed in double auctions.
Games Econ. Behav., 2017

Twenty Lectures on Algorithmic Game Theory.
Bull. EATCS, 2017

Pricing Identical Items.
CoRR, 2017

Why prices need algorithms (invited talk).
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Deferred-Acceptance Auctions for Multiple Levels of Service.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Online Prediction with Selfish Experts.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Stability and Recovery for Independence Systems.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

When Are Welfare Guarantees Robust?.
Proceedings of the Approximation, 2017

2016
Optimal and Robust Mechanism Design with Interdependent Values.
ACM Trans. Economics and Comput., 2016

Network Cost-Sharing without Anonymity.
ACM Trans. Economics and Comput., 2016

Private Matchings and Allocations.
SIAM J. Comput., 2016

Decompositions of Triangle-Dense Graphs.
SIAM J. Comput., 2016

Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.
J. ACM, 2016

Optimal Cost-Sharing in General Resource Selection Games.
Oper. Res., 2016

On the Communication Complexity of Approximate Fixed Points.
Electron. Colloquium Comput. Complex., 2016

Mathematical foundations for social computing.
Commun. ACM, 2016

The price of anarchy in large games.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Ironing in the Dark.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Intrinsic Robustness of the Price of Anarchy: Abstract of the Kalai Prize Talk.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Incentive Compatibility of Bitcoin Mining Pool Reward Functions.
Proceedings of the Financial Cryptography and Data Security, 2016

The Complexity of the k-means Method.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Learning Simple Auctions.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
The Price of Anarchy in Games of Incomplete Information.
ACM Trans. Economics and Comput., 2015

Restoring Pure Equilibria to Weighted Congestion Games.
ACM Trans. Economics and Comput., 2015

Why prices need algorithms.
SIGecom Exch., 2015

Preventing Unraveling in Social Networks: The Anchored k-Core Problem.
SIAM J. Discret. Math., 2015

Special Section on the Fifty-Third IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012).
SIAM J. Comput., 2015

Local smoothness and the price of anarchy in splittable congestion games.
J. Econ. Theory, 2015

Revenue maximization with a single sample.
Games Econ. Behav., 2015

Special Section of Games and Economic Behavior dedicated to the 11th and 12th ACM Conference on Electronic Commerce.
Games Econ. Behav., 2015

Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011.
Games Econ. Behav., 2015

Communication Complexity (for Algorithm Designers).
Electron. Colloquium Comput. Complex., 2015

Computing Equilibria: A Computational Complexity Perspective.
Electron. Colloquium Comput. Complex., 2015

The Pseudo-Dimension of Near-Optimal Auctions.
CoRR, 2015

On the Pseudo-Dimension of Nearly Optimal Auctions.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

How Hard is Inference for Structured Prediction?
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness.
ACM Trans. Economics and Comput., 2014

Generalized Efficiency Bounds in Distributed Resource Allocation.
IEEE Trans. Autom. Control., 2014

Approximately optimal mechanism design: motivation, examples, and lessons learned.
SIGecom Exch., 2014

Black-Box Randomized Reductions in Algorithmic Mechanism Design.
SIAM J. Comput., 2014

Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372).
Dagstuhl Reports, 2014

Optimal Platform Design.
CoRR, 2014

Tight Error Bounds for Structured Prediction.
CoRR, 2014

Optimal Cost-Sharing in Weighted Congestion Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

The sample complexity of revenue maximization.
Proceedings of the Symposium on Theory of Computing, 2014

Privately Solving Linear Programs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Barriers to Near-Optimal Equilibria.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Optimal and near-optimal mechanism design with interdependent values.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Near-optimal multi-unit auctions with ordered bidders.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Marginals-to-Models Reducibility.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012
Revenue Submodularity.
Theory Comput., 2012

Universally Utility-maximizing Privacy Mechanisms.
SIAM J. Comput., 2012

Bottleneck links, variable demand, and the tragedy of the commons.
Networks, 2012

Near-Optimal Multi-Unit Auctions with Ordered Bidders
CoRR, 2012

Intrinsic robustness of the price of anarchy.
Commun. ACM, 2012

Simultaneous Single-Item Auctions.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Prior-free auctions with ordered bidders.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Sketching valuation functions.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Supply-limiting mechanisms.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Combinatorial auctions with restricted complements.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Metric Clustering via Consistent Labeling.
Theory Comput., 2011

Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing.
SIAM J. Discret. Math., 2011

Truthful Approximation Schemes for Single-Parameter Agents.
SIAM J. Comput., 2011

An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries
CoRR, 2011

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders
CoRR, 2011

From convex optimization to randomized mechanisms: toward optimal combinatorial auctions.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Welfare Guarantees for Combinatorial Auctions with Item Bidding.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Flexible Tree Matching.
Proceedings of the IJCAI 2011, 2011

Uncoupled potentials for proportional allocation markets.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
Fully Distributed Algorithms for Convex Optimization Problems.
SIAM J. Optim., 2010

Designing Network Protocols for Good Equilibria.
SIAM J. Comput., 2010

Braess's Paradox in large random graphs.
Random Struct. Algorithms, 2010

Algorithmic game theory.
Commun. ACM, 2010

The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Interactive privacy via the median mechanism.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Truthfulness via smoothed complexity.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Simple versus optimal mechanisms.
SIGecom Exch., 2009

Bertrand competition in networks.
SIGecom Exch., 2009

Network Design with Weighted Players.
Theory Comput. Syst., 2009

Quantifying inefficiency in cost-sharing mechanisms.
J. ACM, 2009

Beyond Moulin mechanisms.
Games Econ. Behav., 2009

The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries
CoRR, 2009

Lightweight Coloring and Desynchronization for Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Worst-Case Efficiency Analysis of Queueing Disciplines.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
The Price of Stability for Network Design with Fair Cost Allocation.
SIAM J. Comput., 2008

Computing correlated equilibria in multi-player games.
J. ACM, 2008

Optimal Mechansim Design and Money Burning
CoRR, 2008

Optimal mechanism design and money burning.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Designing networks with good equilibria.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Bertrand Competition in Networks.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Algorithmic Game Theory: Some Greatest Hits and Future Directions.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
The price of anarchy in an exponential multi-server.
Oper. Res. Lett., 2007

Guest Editorial Non-Cooperative Behavior in Networking.
IEEE J. Sel. Areas Commun., 2007

Approximation via cost sharing: Simpler and better approximation algorithms for network design.
J. ACM, 2007

Optimal Efficiency Guarantees for Network Design Mechanisms.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
On the severity of Braess's Paradox: Designing networks for selfish users is hard.
J. Comput. Syst. Sci., 2006

How much can taxes help selfish routing?
J. Comput. Syst. Sci., 2006

Planning Tours of Robotic Arms among Partitioned Goals.
Int. J. Robotics Res., 2006

Approximately Efficient Cost-Sharing Mechanisms
CoRR, 2006

Optimal Cost-Sharing Mechanisms for Steiner Forest Problems.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

New trade-offs in cost-sharing mechanisms.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Routers with Very Small Buffers.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Single-Source Stochastic Routing.
Proceedings of the Approximation, 2006

2005
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner.
SIGACT News, 2005

Part III: routers with very small buffers.
Comput. Commun. Rev., 2005

Selfish routing with atomic players.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Computing equilibria in multi-player games.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Selfish routing and the price of anarchy.
MIT Press, ISBN: 978-0-262-18243-0, 2005

2004
Stackelberg Scheduling Strategies.
SIAM J. Comput., 2004

Approximate <i>k</i>-MSTs and <i>k</i>-Steiner trees via the primal-dual method and Lagrangean relaxation.
Math. Program., 2004

Bounding the inefficiency of equilibria in nonatomic congestion games.
Games Econ. Behav., 2004

The maximum latency of selfish routing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A stronger bound on Braess's Paradox.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
The price of anarchy is independent of the network topology.
J. Comput. Syst. Sci., 2003

Simpler and better approximation algorithms for network design.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Pricing network edges for heterogeneous selfish users.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Selfish Routing.
PhD thesis, 2002

How bad is selfish routing?
J. ACM, 2002

On a game in directed graphs.
Inf. Process. Lett., 2002

How unfair is optimal routing?
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A Constant-Factor Approximation Algorithm for the Multicommodity.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Designing Networks for Selfish Users is Hard.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001


  Loading...