Timothy Roughgarden
Affiliations: Stanford University, USA
According to our database^{1},
Timothy Roughgarden
authored at least 178 papers
between 2001 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on id.loc.gov

on dnb.info

on dl.acm.org
On csauthors.net:
Bibliography
2022
CoRR, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
SIGecom Exch., 2021
SIAM J. Comput., 2021
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals.
CoRR, 2021
CoRR, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the Financial Cryptography and Data Security, 2021
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021
2020
ACM Trans. Economics and Comput., 2020
ACM Trans. Economics and Comput., 2020
Theor. Comput. Sci., 2020
SIAM J. Discret. Math., 2020
SIAM J. Comput., 2020
SIAM J. Comput., 2020
Optimal Algorithms for Continuous Nonmonotone Submodular and DRSubmodular Maximization.
J. Mach. Learn. Res., 2020
Oper. Res., 2020
Found. Trends Theor. Comput. Sci., 2020
Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP1559.
CoRR, 2020
CoRR, 2020
CoRR, 2020
CoRR, 2020
CoRR, 2020
CoRR, 2020
CoRR, 2020
CoRR, 2020
Commun. ACM, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Beyond the WorstCase Analysis of Algorithms, 2020
Proceedings of the Beyond the WorstCase Analysis of Algorithms, 2020
Proceedings of the Beyond the WorstCase Analysis of Algorithms, 2020
Proceedings of the Beyond the WorstCase Analysis of Algorithms, 2020
2019
ACM Trans. Economics and Comput., 2019
Introduction to the Special Issue  Algorithmic Game Theory  STOC/FOCS/SODA 2012.
Games Econ. Behav., 2019
Commun. ACM, 2019
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Proceedings of the Conference on Learning Theory, 2019
Proceedings of the 1st ACM Conference on Advances in Financial Technologies, 2019
2018
ACM Trans. Economics and Comput., 2018
SIAM J. Comput., 2018
J. ACM, 2018
Games Econ. Behav., 2018
Electron. Colloquium Comput. Complex., 2018
CoRR, 2018
CoRR, 2018
CoRR, 2018
Proceedings of the Conference On Learning Theory, 2018
2017
SIAM J. Comput., 2017
Math. Oper. Res., 2017
J. Artif. Intell. Res., 2017
Games Econ. Behav., 2017
Bull. EATCS, 2017
CoRR, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Proceedings of the Approximation, 2017
2016
ACM Trans. Economics and Comput., 2016
ACM Trans. Economics and Comput., 2016
SIAM J. Comput., 2016
SIAM J. Comput., 2016
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.
J. ACM, 2016
Oper. Res., 2016
Electron. Colloquium Comput. Complex., 2016
Commun. ACM, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
Proceedings of the Financial Cryptography and Data Security, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 29th Conference on Learning Theory, 2016
2015
ACM Trans. Economics and Comput., 2015
ACM Trans. Economics and Comput., 2015
SIGecom Exch., 2015
SIAM J. Discret. Math., 2015
Special Section on the FiftyThird IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012).
SIAM J. Comput., 2015
J. Econ. Theory, 2015
J. ACM, 2015
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
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
CoRR, 2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Proceedings of the 32nd International Conference on Machine Learning, 2015
2014
Weighted Congestion Games: The Price of Anarchy, Universal WorstCase Examples, and Tightness.
ACM Trans. Economics and Comput., 2014
IEEE Trans. Autom. Control., 2014
Approximately optimal mechanism design: motivation, examples, and lessons learned.
SIGecom Exch., 2014
SIAM J. Comput., 2014
Dagstuhl Reports, 2014
CoRR, 2014
CoRR, 2014
Proceedings of the Web and Internet Economics  10th International Conference, 2014
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
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 58, 2013
2012
Theory Comput., 2012
SIAM J. Comput., 2012
Networks, 2012
CoRR, 2012
Proceedings of the Internet and Network Economics  8th International Workshop, 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the TwentyThird Annual ACMSIAM Symposium on Discrete Algorithms, 2012
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
2011
Theory Comput., 2011
SIAM J. Discret. Math., 2011
SIAM J. Comput., 2011
An approximately truthfulinexpectation 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
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the IJCAI 2011, 2011
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011
2010
SIAM J. Optim., 2010
SIAM J. Comput., 2010
Random Struct. Algorithms, 2010
Commun. ACM, 2010
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Behavioral and Quantitative Game Theory, 2010
2009
SIGecom Exch., 2009
SIGecom Exch., 2009
Theory Comput. Syst., 2009
J. ACM, 2009
Games Econ. Behav., 2009
CoRR, 2009
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009
2008
SIAM J. Comput., 2008
J. ACM, 2008
CoRR, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008
2007
Oper. Res. Lett., 2007
IEEE J. Sel. Areas Commun., 2007
Approximation via cost sharing: Simpler and better approximation algorithms for network design.
J. ACM, 2007
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
J. Comput. Syst. Sci., 2006
Int. J. Robotics Res., 2006
CoRR, 2006
Proceedings of the Internet and Network Economics, Second International Workshop, 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Proceedings of the Approximation, 2006
2005
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner.
SIGACT News, 2005
Comput. Commun. Rev., 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Selfish routing and the price of anarchy.
MIT Press, ISBN: 9780262182430, 2005
2004
SIAM J. Comput., 2004
Approximate <i>k</i>MSTs and <i>k</i>Steiner trees via the primaldual method and Lagrangean relaxation.
Math. Program., 2004
Games Econ. Behav., 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
2003
J. Comput. Syst. Sci., 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Approximation Via CostSharing: A Simple Approximation Algorithm for the Multicommodity RentorBuy Problem.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
2002
Selfish Routing.
PhD thesis, 2002
J. ACM, 2002
Inf. Process. Lett., 2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
2001
Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001