Tim Roughgarden

323 papers A* 91A 9B 13Journal 171Unranked 31
YearRankTypeTitle / Venue / Authors
2026 J jnl
Beyond Winner-Take-All Procurement Auctions.
CoRR
Pranav Garimidi, Michael Neuder, Tim Roughgarden
2025 A* conf
Accountable Liveness.
CCS
Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca Zanolini
2025 J jnl
Accountable Liveness.
CoRR
Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca Zanolini
2025 J jnl
Accountable Liveness.
IACR Cryptol. ePrint Arch.
Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca Zanolini
2025 J jnl
Beyond Optimal Fault Tolerance.
CoRR
Andrew Lewis-Pye, Tim Roughgarden
2025 B conf
Beyond Optimal Fault-Tolerance.
AFT
Andrew Lewis-Pye, Tim Roughgarden
2025 J jnl
Beyond Optimal Fault-Tolerance.
IACR Cryptol. ePrint Arch.
Andrew Lewis-Pye, Tim Roughgarden
2025 B conf
From Permissioned to Proof-of-Stake Consensus.
AFT
Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Ertem Nusret Tas
2025 J jnl
From Permissioned to Proof-of-Stake Consensus.
CoRR
Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Ertem Nusret Tas
2025 J jnl
From Permissioned to Proof-of-Stake Consensus.
IACR Cryptol. ePrint Arch.
Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Ertem Nusret Tas
2025 J jnl
Incentive-Compatible Recovery from Manipulated Signals, with Applications to Decentralized Physical Infrastructure.
CoRR
Jason Milionis, Jens Ernstberger, Joseph Bonneau, Scott Duke Kominers, Tim Roughgarden
2025 A conf
Robust Restaking Networks.
ITCS
Naveen Durvasula, Tim Roughgarden
2025 A* conf
Shill-Proof Auctions.
EC
Andrew Komo, Scott Duke Kominers, Tim Roughgarden
2025 — conf
Transaction Fee Mechanism Design for Leaderless Blockchain Protocols.
FC (2)
Pranav Garimidi, Lioba Heimbach, Tim Roughgarden
2025 J jnl
Transaction Fee Mechanism Design for Leaderless Blockchain Protocols.
CoRR
Pranav Garimidi, Lioba Heimbach, Tim Roughgarden
2024 A conf
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers.
ITCS
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
2024 — conf
Automated Market Making and Arbitrage Profits in the Presence of Fees.
FC (1)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
2024 J jnl
Centralization in Block Building and Proposer-Builder Separation.
CoRR
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2024 — conf
Centralization in Block-Building and Proposer-Builder Separation.
FC (1)
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2024 A* conf
Collusion-Resilience in Transaction Fee Mechanism Design.
EC
Hao Chung, Tim Roughgarden, Elaine Shi
2024 J jnl
Collusion-Resilience in Transaction Fee Mechanism Design.
CoRR
Hao Chung, Tim Roughgarden, Elaine Shi
2024 J jnl
Collusion-Resilience in Transaction Fee Mechanism Design.
IACR Cryptol. ePrint Arch.
Hao Chung, Tim Roughgarden, Elaine Shi
2024 A* conf
Keynote: Provable Slashing Guarantees.
PODC
Tim Roughgarden
2024 A* conf
Online Stackelberg Optimization via Nonlinear Control.
COLT
William Brown, Christos H. Papadimitriou, Tim Roughgarden
2024 J jnl
Online Stackelberg Optimization via Nonlinear Control.
CoRR
William Brown, Christos H. Papadimitriou, Tim Roughgarden
2024 J jnl
Robust Restaking Networks.
CoRR
Naveen Durvasula, Tim Roughgarden
2024 J jnl
Shill-Proof Auctions.
CoRR
Andrew Komo, Scott Duke Kominers, Tim Roughgarden
2024 J jnl
Smoothed Analysis with Adaptive Adversaries.
J. ACM
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
2024 A* conf
The Computer in the Sky (Keynote).
STOC
Tim Roughgarden
2024 A* conf
The Economic Limits of Permissionless Consensus.
EC
Eric Budish, Andrew Lewis-Pye, Tim Roughgarden
2024 J jnl
The Economic Limits of Permissionless Consensus.
CoRR
Eric Budish, Andrew Lewis-Pye, Tim Roughgarden
2024 J jnl
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience.
CoRR
Jovan Komatovic, Joachim Neu, Tim Roughgarden
2024 J jnl
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Jovan Komatovic, Joachim Neu, Tim Roughgarden
2024 B conf
Transaction Fee Mechanism Design in a Post-MEV World.
AFT
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2024 J jnl
Transaction Fee Mechanism Design in a Post-MEV World.
IACR Cryptol. ePrint Arch.
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2024 — conf
Transaction Fee Mechanism Design with Active Block Producers.
FC Workshops
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2024 J jnl
Transaction Fee Mechanism Design.
J. ACM
Tim Roughgarden
2023 J jnl
A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers.
CoRR
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
2023 — conf
Byzantine Generals in the Permissionless Setting.
FC (1)
Andrew Lewis-Pye, Tim Roughgarden
2023 — conf
Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs.
FC (1)
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
2023 J jnl
Complexity-Approximation Trade-offs in Exchange Mechanisms: AMMs vs. LOBs.
CoRR
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
2023 — conf
Extended Abstract: The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers.
FC Workshops
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden
2023 A* conf
Formalizing Preferences Over Runtime Distributions.
ICML
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
2023 J jnl
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.
Oper. Res.
Eric Neyman, Tim Roughgarden
2023 A* conf
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling.
NeurIPS
Eric Neyman, Tim Roughgarden
2023 J jnl
Permissionless Consensus.
CoRR
Andrew Lewis-Pye, Tim Roughgarden
2023 J jnl
Transaction Fee Mechanism Design with Active Block Producers.
CoRR
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2023 A* conf
Utilitarian Algorithm Configuration.
NeurIPS
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
2023 J jnl
Utilitarian Algorithm Configuration.
CoRR
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
2023 B conf
When Bidders Are DAOs.
AFT
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2023 J jnl
When Bidders Are DAOs.
CoRR
Maryam Bahrani, Pranav Garimidi, Tim Roughgarden
2022 A* conf
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals.
EC
Eric Neyman, Tim Roughgarden
2022 A conf
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs.
ITCS
Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri
2022 J jnl
Formalizing Preferences Over Runtime Distributions.
CoRR
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
2022 J jnl
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling.
CoRR
Eric Neyman, Tim Roughgarden
2022 — conf
Quantifying Loss in Automated Market Makers.
DeFi@CCS
Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden, Anthony Lee Zhang
2022 A* conf
Strictly Proper Contract Functions Can Be Arbitrage-Free.
AAAI
Eric Neyman, Tim Roughgarden
2021 J jnl
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals.
CoRR
Eric Neyman, Tim Roughgarden
2021 A* conf
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.
EC
Eric Neyman, Tim Roughgarden
2021 J jnl
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.
CoRR
Eric Neyman, Tim Roughgarden
2021 A* conf
How Does Blockchain Security Dictate Blockchain Implementation?
CCS
Andrew Lewis-Pye, Tim Roughgarden
2021 J jnl
How Does Blockchain Security Dictate Blockchain Implementation?
CoRR
Andrew Lewis-Pye, Tim Roughgarden
2021 — conf
Ignore the Extra Zeroes: Variance-Optimal Mining Pools.
Financial Cryptography (2)
Tim Roughgarden, Clara Shikhelman
2021 B ed.
Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, AFT 2021, Arlington, Virginia, USA, September 26-28, 2021
AFT
Foteini Baldimtsi, Tim Roughgarden
2021 A* conf
Smoothed Analysis with Adaptive Adversaries.
FOCS
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
2021 J jnl
Smoothed Analysis with Adaptive Adversaries.
CoRR
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
2021 J jnl
Strictly Proper Contract Functions Can Be Arbitrage-Free.
CoRR
Eric Neyman, Tim Roughgarden
2021 J jnl
The Complexity of Contracts.
SIAM J. Comput.
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
2021 A* conf
Transaction Fee Mechanism Design.
EC
Tim Roughgarden
2021 J jnl
Transaction Fee Mechanism Design.
CoRR
Tim Roughgarden
2021 J jnl
Transaction fee mechanism design.
SIGecom Exch.
Tim Roughgarden
2020 J jnl
Almost Envy-Freeness with General Valuations.
SIAM J. Discret. Math.
Benjamin Plaut, Tim Roughgarden
2020 J jnl
Approximately Efficient Two-Sided Combinatorial Auctions.
ACM Trans. Economics and Comput.
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2020 — book
Beyond the Worst-Case Analysis of Algorithms
Tim Roughgarden
2020 J jnl
Beyond the Worst-Case Analysis of Algorithms (Introduction).
CoRR
Tim Roughgarden
2020 J jnl
Communication Complexity of Discrete Fair Division.
SIAM J. Comput.
Benjamin Plaut, Tim Roughgarden
2020 J jnl
Complexity Theory, Game Theory, and Economics: The Barbados Lectures.
Found. Trends Theor. Comput. Sci.
Tim Roughgarden
2020 J jnl
Data-driven algorithm design.
Commun. ACM
Rishi Gupta, Tim Roughgarden
2020 — ch.
Distribution-Free Models of Social Networks.
Beyond the Worst-Case Analysis of Algorithms
Tim Roughgarden, C. Seshadhri
2020 J jnl
Distribution-Free Models of Social Networks.
CoRR
Tim Roughgarden, C. Seshadhri
2020 — ch.
Distributional Analysis.
Beyond the Worst-Case Analysis of Algorithms
Tim Roughgarden
2020 J jnl
Distributional Analysis.
CoRR
Tim Roughgarden
2020 J jnl
FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs.
CoRR
Edin Husic, Tim Roughgarden
2020 J jnl
Finding Cliques in Social Networks: A New Distribution-Free Model.
SIAM J. Comput.
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2020 — ch.
Introduction.
Beyond the Worst-Case Analysis of Algorithms
Tim Roughgarden
2020 J jnl
Mathematical Foundations for Social Computing.
CoRR
Yiling Chen, Arpita Ghosh, Michael Kearns, Tim Roughgarden, Jennifer Wortman Vaughan
2020 J jnl
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.
J. Mach. Learn. Res.
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
2020 J jnl
Pricing Multi-Unit Markets.
ACM Trans. Economics and Comput.
Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong
2020 J jnl
Prior-free multi-unit auctions with ordered bidders.
Theor. Comput. Sci.
Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu
2020 — ch.
Resource Augmentation.
Beyond the Worst-Case Analysis of Algorithms
Tim Roughgarden
2020 J jnl
Resource Augmentation.
CoRR
Tim Roughgarden
2020 J jnl
Resource Pools and the CAP Theorem.
CoRR
Andrew Lewis-Pye, Tim Roughgarden
2020 J jnl
Robust Auctions for Revenue via Enhanced Competition.
Oper. Res.
Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan
2020 A* conf
Smoothed Analysis of Online and Differentially Private Learning.
NeurIPS
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
2020 J jnl
Smoothed Analysis of Online and Differentially Private Learning.
CoRR
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
2020 A* conf
The Complexity of Contracts.
SODA
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
2020 J jnl
The Complexity of Contracts.
CoRR
Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen
2020 J jnl
Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559.
CoRR
Tim Roughgarden
2019 B conf
An Axiomatic Approach to Block Rewards.
AFT
Xi Chen, Christos H. Papadimitriou, Tim Roughgarden
2019 J jnl
An Axiomatic Approach to Block Rewards.
CoRR
Xi Chen, Christos H. Papadimitriou, Tim Roughgarden
2019 J jnl
Beyond worst-case analysis.
Commun. ACM
Tim Roughgarden
2019 A* conf
Communication Complexity of Discrete Fair Division.
SODA
Benjamin Plaut, Tim Roughgarden
2019 — conf
How Computer Science Informs Modern Auction Design (Invited Talk).
FSTTCS
Tim Roughgarden
2019 J jnl
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2012.
Games Econ. Behav.
Nikhil R. Devanur, Jason D. Hartline, Tim Roughgarden
2019 J jnl
Minimizing Regret with Multiple Reserves.
ACM Trans. Economics and Comput.
Tim Roughgarden, Joshua R. Wang
2019 A* conf
On the Computational Power of Online Gradient Descent.
COLT
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
2019 A* conf
Simple versus Optimal Contracts.
EC
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
2018 A* conf
Almost Envy-Freeness with General Valuations.
SODA
Benjamin Plaut, Tim Roughgarden
2018 J jnl
An Optimal Algorithm for Online Unconstrained Submodular Maximization.
CoRR
Tim Roughgarden, Joshua R. Wang
2018 A* conf
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization.
COLT
Tim Roughgarden, Joshua R. Wang
2018 J jnl
Approximately Optimal Mechanism Design.
CoRR
Tim Roughgarden, Inbal Talgam-Cohen
2018 J jnl
Beyond Worst-Case Analysis.
CoRR
Tim Roughgarden
2018 J jnl
Complexity Theory, Game Theory, and Economics.
CoRR
Tim Roughgarden
2018 J jnl
Complexity Theory, Game Theory, and Economics.
Electron. Colloquium Comput. Complex.
Tim Roughgarden
2018 A* conf
Finding Cliques in Social Networks: A New Distribution-Free Model.
ICALP
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2018 J jnl
Finding Cliques in Social Networks: A New Distribution-Free Model.
CoRR
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2018 J jnl
Is Shapley cost sharing optimal?
Games Econ. Behav.
Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
2018 J jnl
Making the Most of Your Samples.
SIAM J. Comput.
Zhiyi Huang, Yishay Mansour, Tim Roughgarden
2018 J jnl
On the Computational Power of Online Gradient Descent.
CoRR
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
2018 A* conf
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.
NeurIPS
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
2018 J jnl
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.
CoRR
Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
2018 — conf
Pricing Multi-unit Markets.
WINE
Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong
2018 J jnl
Public Projects, Boolean Functions, and the Borders of Border's Theorem.
ACM Trans. Economics and Comput.
Parikshit Gopalan, Noam Nisan, Tim Roughgarden
2018 J jnl
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation).
J. ACM
Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang
2018 J jnl
Simple versus Optimal Contracts.
CoRR
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
2018 J jnl
The idemetric property: when most distances are (almost) the same.
CoRR
George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden
2017 J jnl
A PAC Approach to Application-Specific Algorithm Selection.
SIAM J. Comput.
Rishi Gupta, Tim Roughgarden
2017 J jnl
Almost Envy-Freeness with General Valuations.
CoRR
Benjamin Plaut, Tim Roughgarden
2017 A* conf
Approximately Efficient Two-Sided Combinatorial Auctions.
EC
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2017 J jnl
Communication Complexity of Discrete Fair Division.
CoRR
Benjamin Plaut, Tim Roughgarden
2017 A* conf
Deferred-Acceptance Auctions for Multiple Levels of Service.
EC
Vasilis Gkatzelis, Evangelos Markakis, Tim Roughgarden
2017 J jnl
Modularity and greed in double auctions.
Games Econ. Behav.
Paul Dütting, Inbal Talgam-Cohen, Tim Roughgarden
2017 — conf
Online Prediction with Selfish Experts.
NIPS
Tim Roughgarden, Okke Schrijvers
2017 J jnl
Online Prediction with Selfish Experts.
CoRR
Tim Roughgarden, Okke Schrijvers
2017 J jnl
Pricing Identical Items.
CoRR
Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong
2017 A conf
Stability and Recovery for Independence Systems.
ESA
Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák
2017 J jnl
Stability and Recovery for Independence Systems.
CoRR
Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák
2017 J jnl
The Performance of Deferred-Acceptance Auctions.
Math. Oper. Res.
Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden
2017 J jnl
The Price of Anarchy in Auctions.
J. Artif. Intell. Res.
Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos
2017 J jnl
Twenty Lectures on Algorithmic Game Theory.
Bull. EATCS
Tim Roughgarden, Kazuo Iwama
2017 — conf
When Are Welfare Guarantees Robust?.
APPROX-RANDOM
Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák
2017 A* conf
Why prices need algorithms (invited talk).
STOC
Tim Roughgarden, Inbal Talgam-Cohen
2016 A conf
A PAC Approach to Application-Specific Algorithm Selection.
ITCS
Rishi Gupta, Tim Roughgarden
2016 J jnl
Approximately Efficient Two-Sided Combinatorial Auctions.
CoRR
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2016 J jnl
Communication Complexity (for Algorithm Designers).
Found. Trends Theor. Comput. Sci.
Tim Roughgarden
2016 J jnl
Decompositions of Triangle-Dense Graphs.
SIAM J. Comput.
Rishi Gupta, Tim Roughgarden, C. Seshadhri
2016 — conf
Incentive Compatibility of Bitcoin Mining Pool Reward Functions.
Financial Cryptography
Okke Schrijvers, Joseph Bonneau, Dan Boneh, Tim Roughgarden
2016 A* conf
Intrinsic Robustness of the Price of Anarchy: Abstract of the Kalai Prize Talk.
EC
Tim Roughgarden
2016 A* conf
Ironing in the Dark.
EC
Tim Roughgarden, Okke Schrijvers
2016 A* conf
Learning Simple Auctions.
COLT
Jamie Morgenstern, Tim Roughgarden
2016 J jnl
Learning Simple Auctions.
CoRR
Jamie Morgenstern, Tim Roughgarden
2016 J jnl
Mathematical foundations for social computing.
Commun. ACM
Yiling Chen, Arpita Ghosh, Michael J. Kearns, Tim Roughgarden, Jennifer Wortman Vaughan
2016 A* conf
Minimizing Regret with Multiple Reserves.
EC
Tim Roughgarden, Joshua R. Wang
2016 J jnl
Network Cost-Sharing without Anonymity.
ACM Trans. Economics and Comput.
Tim Roughgarden, Okke Schrijvers
2016 A* conf
On the Communication Complexity of Approximate Fixed Points.
FOCS
Tim Roughgarden, Omri Weinstein
2016 J jnl
On the Communication Complexity of Approximate Fixed Points.
Electron. Colloquium Comput. Complex.
Tim Roughgarden, Omri Weinstein
2016 J jnl
Optimal Cost-Sharing in General Resource Selection Games.
Oper. Res.
Vasilis Gkatzelis, Konstantinos Kollias, Tim Roughgarden
2016 J jnl
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.
J. ACM
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
2016 J jnl
Optimal and Robust Mechanism Design with Interdependent Values.
ACM Trans. Economics and Comput.
Tim Roughgarden, Inbal Talgam-Cohen
2016 J jnl
Private Matchings and Allocations.
SIAM J. Comput.
Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu
2016 B conf
Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation).
SPAA
Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang
2016 A conf
The Complexity of the k-means Method.
ESA
Tim Roughgarden, Joshua R. Wang
2016 J jnl
The Price of Anarchy in Auctions.
CoRR
Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos
2016 A* conf
The price of anarchy in large games.
STOC
Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis
2016 J jnl
When Are Welfare Guarantees Robust?
CoRR
Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák
2016 A* conf
Why Prices Need Algorithms.
IJCAI
Tim Roughgarden, Inbal Talgam-Cohen
2015 J jnl
A PAC Approach to Application-Specific Algorithm Selection.
CoRR
Rishi Gupta, Tim Roughgarden
2015 J jnl
Communication Complexity (for Algorithm Designers).
CoRR
Tim Roughgarden
2015 J jnl
Communication Complexity (for Algorithm Designers).
Electron. Colloquium Comput. Complex.
Tim Roughgarden
2015 J jnl
Computing Equilibria: A Computational Complexity Perspective.
Electron. Colloquium Comput. Complex.
Tim Roughgarden
2015 A* conf
How Hard is Inference for Structured Prediction?
ICML
Amir Globerson, Tim Roughgarden, David A. Sontag, Cafer Yildirim
2015 J jnl
Intrinsic Robustness of the Price of Anarchy.
J. ACM
Tim Roughgarden
2015 J jnl
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011.
Games Econ. Behav.
Shuchi Chawla, Lisa Fleischer, Jason D. Hartline, Tim Roughgarden
2015 J jnl
Ironing in the Dark.
CoRR
Tim Roughgarden, Okke Schrijvers
2015 J jnl
Local smoothness and the price of anarchy in splittable congestion games.
J. Econ. Theory
Tim Roughgarden, Florian Schoppmann
2015 A* conf
Making the Most of Your Samples.
EC
Zhiyi Huang, Yishay Mansour, Tim Roughgarden
2015 — conf
On the Pseudo-Dimension of Nearly Optimal Auctions.
NIPS
Jamie Morgenstern, Tim Roughgarden
2015 J jnl
Preventing Unraveling in Social Networks: The Anchored k-Core Problem.
SIAM J. Discret. Math.
Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma
2015 A ed.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015
ITCS
Tim Roughgarden
2015 A* ed.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15-19, 2015
EC
Tim Roughgarden, Michal Feldman, Michael Schwarz
2015 A* conf
Public Projects, Boolean Functions, and the Borders of Border's Theorem.
EC
Parikshit Gopalan, Noam Nisan, Tim Roughgarden
2015 J jnl
Public projects, Boolean functions and the borders of Border's theorem.
CoRR
Parikshit Gopalan, Noam Nisan, Tim Roughgarden
2015 J jnl
Restoring Pure Equilibria to Weighted Congestion Games.
ACM Trans. Economics and Comput.
Konstantinos Kollias, Tim Roughgarden
2015 J jnl
Revenue maximization with a single sample.
Games Econ. Behav.
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
2015 J jnl
Special Section of Games and Economic Behavior dedicated to the 11th and 12th ACM Conference on Electronic Commerce.
Games Econ. Behav.
Yan Chen, Tim Roughgarden
2015 J jnl
Special Section on the Fifty-Third IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012).
SIAM J. Comput.
Tim Roughgarden
2015 J jnl
The Price of Anarchy in Games of Incomplete Information.
ACM Trans. Economics and Comput.
Tim Roughgarden
2015 J jnl
The Price of Anarchy in Large Games.
CoRR
Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis
2015 J jnl
The Pseudo-Dimension of Near-Optimal Auctions.
CoRR
Jamie Morgenstern, Tim Roughgarden
2015 J jnl
The Sample Complexity of Revenue Maximization.
CoRR
Richard Cole, Tim Roughgarden
2015 A* conf
Why Prices Need Algorithms.
EC
Tim Roughgarden, Inbal Talgam-Cohen
2015 J jnl
Why prices need algorithms.
SIGecom Exch.
Tim Roughgarden, Inbal Talgam-Cohen
2014 J jnl
Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372).
Dagstuhl Reports
Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden
2014 J jnl
Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned.
CoRR
Tim Roughgarden
2014 J jnl
Approximately optimal mechanism design: motivation, examples, and lessons learned.
SIGecom Exch.
Tim Roughgarden
2014 A* conf
Barriers to Near-Optimal Equilibria.
FOCS
Tim Roughgarden
2014 J jnl
Black-Box Randomized Reductions in Algorithmic Mechanism Design.
SIAM J. Comput.
Shaddin Dughmi, Tim Roughgarden
2014 A conf
Decompositions of triangle-dense graphs.
ITCS
Rishi Gupta, Tim Roughgarden, C. Seshadhri
2014 J jnl
Generalized Efficiency Bounds in Distributed Resource Allocation.
IEEE Trans. Autom. Control.
Jason R. Marden, Tim Roughgarden
2014 J jnl
Making the Most of Your Samples.
CoRR
Zhiyi Huang, Yishay Mansour, Tim Roughgarden
2014 A* conf
Modularity and greed in double auctions.
EC
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
2014 B conf
Network Cost-Sharing without Anonymity.
SAGT
Tim Roughgarden, Okke Schrijvers
2014 — conf
Optimal Cost-Sharing in Weighted Congestion Games.
WINE
Vasilis Gkatzelis, Konstantinos Kollias, Tim Roughgarden
2014 J jnl
Optimal Platform Design.
CoRR
Jason D. Hartline, Tim Roughgarden
2014 A* conf
Private matchings and allocations.
STOC
Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu
2014 — conf
Privately Solving Linear Programs.
ICALP (1)
Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan R. Ullman
2014 J jnl
Privately Solving Linear Programs.
CoRR
Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan R. Ullman
2014 A* conf
The performance of deferred-acceptance auctions.
EC
Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden
2014 A* conf
The sample complexity of revenue maximization.
STOC
Richard Cole, Tim Roughgarden
2014 J jnl
Tight Error Bounds for Structured Prediction.
CoRR
Amir Globerson, Tim Roughgarden, David A. Sontag, Cafer Yildirim
2014 J jnl
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness.
ACM Trans. Economics and Comput.
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
2013 J jnl
Decompositions of Triangle-Dense Graphs.
CoRR
Rishi Gupta, Tim Roughgarden, C. Seshadhri
2013 — conf
Marginals-to-Models Reducibility.
NIPS
Tim Roughgarden, Michael J. Kearns
2013 A* conf
Near-optimal multi-unit auctions with ordered bidders.
EC
Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu
2013 A* conf
Optimal and near-optimal mechanism design with interdependent values.
EC
Tim Roughgarden, Inbal Talgam-Cohen
2013 J jnl
Private Matchings and Allocations.
CoRR
Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu
2013 A* ed.
Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013
STOC
Dan Boneh, Tim Roughgarden, Joan Feigenbaum
2012 J jnl
Bottleneck links, variable demand, and the tragedy of the commons.
Networks
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2012 J jnl
Combinatorial Auctions with Restricted Complements
CoRR
Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden
2012 A* conf
Combinatorial auctions with restricted complements.
EC
Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden
2012 J jnl
Intrinsic robustness of the price of anarchy.
Commun. ACM
Tim Roughgarden
2012 J jnl
Near-Optimal Multi-Unit Auctions with Ordered Bidders
CoRR
Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden
2012 — conf
Preventing Unraveling in Social Networks: The Anchored k-Core Problem.
ICALP (2)
Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma
2012 A* conf
Prior-free auctions with ordered bidders.
STOC
Stefano Leonardi, Tim Roughgarden
2012 J jnl
Revenue Submodularity.
Theory Comput.
Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
2012 — conf
Simultaneous Single-Item Auctions.
WINE
Kshipra Bhawalkar, Tim Roughgarden
2012 A* conf
Sketching valuation functions.
SODA
Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden
2012 A* conf
Supply-limiting mechanisms.
EC
Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan
2012 A* conf
The price of anarchy in games of incomplete information.
EC
Tim Roughgarden
2012 J jnl
The price of anarchy in games of incomplete information.
SIGecom Exch.
Tim Roughgarden
2012 J jnl
Universally Utility-maximizing Privacy Mechanisms.
SIAM J. Comput.
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
2011 J jnl
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries
CoRR
Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan
2011 A* conf
Flexible Tree Matching.
IJCAI
Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer
2011 J jnl
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders
CoRR
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
2011 A* conf
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions.
STOC
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
2011 A* conf
Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games.
SODA
Tim Roughgarden, Florian Schoppmann
2011 J jnl
Metric Clustering via Consistent Labeling.
Theory Comput.
Robert Krauthgamer, Tim Roughgarden
2011 A* ed.
Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011
EC
Yoav Shoham, Yan Chen, Tim Roughgarden
2011 — conf
Restoring Pure Equilibria to Weighted Congestion Games.
ICALP (2)
Konstantinos Kollias, Tim Roughgarden
2011 J jnl
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing.
SIAM J. Discret. Math.
Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
2011 J jnl
Truthful Approximation Schemes for Single-Parameter Agents.
SIAM J. Comput.
Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden
2011 — conf
Uncoupled potentials for proportional allocation markets.
CDC/ECC
Uri Nadav, Ramesh Johari, Tim Roughgarden
2011 A* conf
Welfare Guarantees for Combinatorial Auctions with Item Bidding.
SODA
Kshipra Bhawalkar, Tim Roughgarden
2010 J jnl
Algorithmic game theory.
Commun. ACM
Tim Roughgarden
2010 A* conf
Black-Box Randomized Reductions in Algorithmic Mechanism Design.
FOCS
Shaddin Dughmi, Tim Roughgarden
2010 J jnl
Braess's Paradox in large random graphs.
Random Struct. Algorithms
Gregory Valiant, Tim Roughgarden
2010 J jnl
Designing Network Protocols for Good Equilibria.
SIAM J. Comput.
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
2010 J jnl
Fully Distributed Algorithms for Convex Optimization Problems.
SIAM J. Optim.
Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah
2010 — conf
Generalized efficiency bounds in distributed resource allocation.
CDC
Jason R. Marden, Tim Roughgarden
2010 A* conf
Interactive privacy via the median mechanism.
STOC
Aaron Roth, Tim Roughgarden
2010 A* conf
Revenue maximization with a single sample.
EC
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
2010 — conf
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds.
WINE
Uri Nadav, Tim Roughgarden
2010 — conf
Truthfulness via smoothed complexity.
BQGT
Shaddin Dughmi, Tim Roughgarden
2010 — conf
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness.
ESA (2)
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
2009 J jnl
Bertrand competition in networks.
SIGecom Exch.
Shuchi Chawla, Feng Niu, Tim Roughgarden
2009 J jnl
Beyond Moulin mechanisms.
Games Econ. Behav.
Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
2009 A* conf
Intrinsic robustness of the price of anarchy.
STOC
Tim Roughgarden
2009 A* conf
Lightweight Coloring and Desynchronization for Networks.
INFOCOM
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leonidas J. Guibas
2009 J jnl
Network Design with Weighted Players.
Theory Comput. Syst.
Ho-Lin Chen, Tim Roughgarden
2009 J jnl
Quantifying inefficiency in cost-sharing mechanisms.
J. ACM
Tim Roughgarden, Mukund Sundararajan
2009 — conf
Revenue Submodularity.
AMMA
Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
2009 A* conf
Revenue submodularity.
EC
Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
2009 A* conf
Simple versus optimal mechanisms.
EC
Jason D. Hartline, Tim Roughgarden
2009 J jnl
Simple versus optimal mechanisms.
SIGecom Exch.
Jason D. Hartline, Tim Roughgarden
2009 J jnl
The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries
CoRR
Aaron Roth, Tim Roughgarden
2009 A* conf
Universally utility-maximizing privacy mechanisms.
STOC
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
2009 — conf
Worst-Case Efficiency Analysis of Queueing Disciplines.
ICALP (2)
Damon Mosk-Aoyama, Tim Roughgarden
2008 — conf
Algorithmic Game Theory: Some Greatest Hits and Future Directions.
IFIP TCS
Tim Roughgarden
2008 B conf
Bertrand Competition in Networks.
SAGT
Shuchi Chawla, Tim Roughgarden
2008 J jnl
Computing correlated equilibria in multi-player games.
J. ACM
Christos H. Papadimitriou, Tim Roughgarden
2008 A* conf
Designing networks with good equilibria.
SODA
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
2008 B conf
Is Shapley Cost Sharing Optimal?
SAGT
Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
2008 A* conf
Metric clustering via consistent labeling.
SODA
Robert Krauthgamer, Tim Roughgarden
2008 J jnl
Optimal Mechansim Design and Money Burning
CoRR
Jason D. Hartline, Tim Roughgarden
2008 A* conf
Optimal mechanism design and money burning.
STOC
Jason D. Hartline, Tim Roughgarden
2008 J jnl
The Price of Stability for Network Design with Fair Cost Allocation.
SIAM J. Comput.
Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
2008 A* conf
Truthful Approximation Schemes for Single-Parameter Agents.
FOCS
Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden
2008 J jnl
Universally Utility-Maximizing Privacy Mechanisms
CoRR
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
2007 — book
Algorithmic Game Theory
Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani
2007 J jnl
Approximation via cost sharing: Simpler and better approximation algorithms for network design.
J. ACM
Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
2007 A* conf
Beyond moulin mechanisms.
EC
Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
2007 A conf
Fully Distributed Algorithms for Convex Optimization Problems.
DISC
Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah
2007 J jnl
Guest Editorial Non-Cooperative Behavior in Networking.
IEEE J. Sel. Areas Commun.
Levente Buttyán, Jean-Pierre Hubaux, Li Li, Xiang-Yang Li, Tim Roughgarden, Alberto Leon-Garcia
2007 B conf
Optimal Efficiency Guarantees for Network Design Mechanisms.
IPCO
Tim Roughgarden, Mukund Sundararajan
2007 J jnl
The price of anarchy in an exponential multi-server.
Oper. Res. Lett.
Moshe Haviv, Tim Roughgarden
2006 J jnl
Approximately Efficient Cost-Sharing Mechanisms
CoRR
Tim Roughgarden, Mukund Sundararajan
2006 A* conf
Bottleneck links, variable demand, and the tragedy of the commons.
SODA
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2006 A* conf
Braess's paradox in large random graphs.
EC
Gregory Valiant, Tim Roughgarden
2006 J jnl
How much can taxes help selfish routing?
J. Comput. Syst. Sci.
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2006 B conf
Network design with weighted players.
SPAA
Ho-Lin Chen, Tim Roughgarden
2006 A* conf
New trade-offs in cost-sharing mechanisms.
STOC
Tim Roughgarden, Mukund Sundararajan
2006 J jnl
On the severity of Braess's Paradox: Designing networks for selfish users is hard.
J. Comput. Syst. Sci.
Tim Roughgarden
2006 — conf
Optimal Cost-Sharing Mechanisms for Steiner Forest Problems.
WINE
Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan
2006 J jnl
Planning Tours of Robotic Arms among Partitioned Goals.
Int. J. Robotics Res.
Mitul Saha, Tim Roughgarden, Jean-Claude Latombe, Gildardo Sánchez-Ante
2006 A* conf
Routers with Very Small Buffers.
INFOCOM
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden
2006 — conf
Single-Source Stochastic Routing.
APPROX-RANDOM
Shuchi Chawla, Tim Roughgarden
2005 J jnl
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner.
SIGACT News
Tim Roughgarden
2005 A* conf
Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability.
ICALP
Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
2005 A* conf
Computing equilibria in multi-player games.
SODA
Christos H. Papadimitriou, Tim Roughgarden
2005 J jnl
Part III: routers with very small buffers.
Comput. Commun. Rev.
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden
2005 — book
Selfish routing and the price of anarchy.
Tim Roughgarden
2005 A* conf
Selfish routing with atomic players.
SODA
Tim Roughgarden
2004 A* conf
A stronger bound on Braess's Paradox.
SODA
Henry C. Lin, Tim Roughgarden, Éva Tardos
2004 J jnl
Approximate
Math. Program.
Fabián A. Chudak, Tim Roughgarden, David P. Williamson
2004 J jnl
Bounding the inefficiency of equilibria in nonatomic congestion games.
Games Econ. Behav.
Tim Roughgarden, Éva Tardos
2004 J jnl
Stackelberg Scheduling Strategies.
SIAM J. Comput.
Tim Roughgarden
2004 A* conf
The Price of Stability for Network Design with Fair Cost Allocation.
FOCS
Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
2004 A* conf
The maximum latency of selfish routing.
SODA
Tim Roughgarden
2003 A* conf
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.
FOCS
Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
2003 A* conf
How much can taxes help selfish routing?
EC
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2003 A* conf
Pricing network edges for heterogeneous selfish users.
STOC
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2003 A* conf
Simpler and better approximation algorithms for network design.
STOC
Anupam Gupta, Amit Kumar, Tim Roughgarden
2003 J jnl
The price of anarchy is independent of the network topology.
J. Comput. Syst. Sci.
Tim Roughgarden
2002 A* conf
A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.
FOCS
Amit Kumar, Anupam Gupta, Tim Roughgarden
2002 J jnl
How bad is selfish routing?
J. ACM
Tim Roughgarden, Éva Tardos
2002 A* conf
How unfair is optimal routing?
SODA
Tim Roughgarden
2002 J jnl
On a game in directed graphs.
Inf. Process. Lett.
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
2002 — —
Selfish Routing.
Tim Roughgarden
2002 A* conf
The price of anarchy is independent of the network topology.
STOC
Tim Roughgarden
2001 B conf
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.
IPCO
Fabián A. Chudak, Tim Roughgarden, David P. Williamson
2001 A* conf
Designing Networks for Selfish Users is Hard.
FOCS
Tim Roughgarden
2001 A* conf
Stackelberg scheduling strategies.
STOC
Tim Roughgarden
2000 A* conf
How Bad is Selfish Routing?
FOCS
Tim Roughgarden, Éva Tardos