EconBase
← All authors

Tim Roughgarden

Columbia University (from arXiv:1801.00734, 2018) · ORCID · OpenAlex

24 papers in scope · 24 published · 1 on the econ.EM arXiv · 1,249 citations · h-index 14 (over the papers listed here)

Papers

(1 of 24)

Smoothed Analysis with Adaptive Adversaries
published2024 · Journal of the ACM · 5 citations · first circulated 2021
with Nika Haghtalab, Abhishek Shetty
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation
published2023 · Operations Research · 11 citations · first circulated 2021
with Eric Neyman
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals
published2022 · Proceedings of the 23rd ACM Conference on Economics and Computation · 6 citations · first circulated 2021
with Eric Neyman
Strictly Proper Contract Functions Can Be Arbitrage-Free
published2022 · Proceedings of the AAAI Conference on Artificial Intelligence · 1 citations · first circulated 2021
with Eric Neyman
Robust Auctions for Revenue via Enhanced Competition
published2020 · Operations Research · 12 citations
with Inbal Talgam-Cohen, Qiqi Yan
published2020 · Foundations and Trends® in Theoretical Computer Science · 5 citations · first circulated 2018
Minimizing Regret with Multiple Reserves
published2019 · ACM Transactions on Economics and Computation · 35 citations · first circulated 2016
with Joshua R. Wang
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization
published2018 · Conference on Learning Theory · 8 citations
with Joshua Wang, Joshua R. Wang
Modularity and greed in double auctions
published2017 · Games and Economic Behavior · 37 citations · first circulated 2014
with Paul Dütting, Inbal Talgam-Cohen
Is Shapley cost sharing optimal?
published2017 · Games and Economic Behavior · 36 citations · first circulated 2008
with Shahar Dobzinski, Aranyak Mehta, M. Sundararajan
Optimal Cost-Sharing in General Resource Selection Games
published2016 · Operations Research · 49 citations
with Vasilis Gkatzelis, Konstantinos Kollias
Learning Simple Auctions
published2016 · Conference on Learning Theory · 45 citations
with Jamie Morgenstern
Communication Complexity (for Algorithm Designers)
published2016 · Foundations and Trends® in Theoretical Computer Science · 16 citations
Introduction to the Special Issue – Algorithmic Game Theory – STOC/FOCS/SODA 2012
published2016 · Games and Economic Behavior · 1 citations
with Nikhil R. Devanur, Jason D. Hartline
Network Cost-Sharing without Anonymity
published2016 · ACM Transactions on Economics and Computation · 20 citations · first circulated 2014
Special Section of Games and Economic Behavior dedicated to the 11th and 12th ACM Conference on Electronic Commerce
published2015 · Games and Economic Behavior
with Yan Chen
Introduction to the Special Issue – Algorithmic Game Theory – STOC/FOCS/SODA 2011
published2015 · Games and Economic Behavior
with Shuchi Chawla, Lisa Fleischer, Jason D. Hartline
On the Pseudo-Dimension of Nearly Optimal Auctions
published2015 · Neural Information Processing Systems · 91 citations
with Jamie Morgenstern
Local smoothness and the price of anarchy in splittable congestion games
published2014 · Journal of Economic Theory · 63 citations · first circulated 2011
with Florian Schoppmann
Revenue maximization with a single sample
published2014 · Games and Economic Behavior · 146 citations · first circulated 2010
with Peerapong Dhangwatnotai, Qiqi Yan
Computing equilibria: a computational complexity perspective
published2009 · Economic Theory · 63 citations
Beyond Moulin mechanisms
published2008 · Games and Economic Behavior · 43 citations · first circulated 2007
with Aranyak Mehta, Mukund Sundararajan
Bounding the inefficiency of equilibria in nonatomic congestion games
published2003 · Games and Economic Behavior · 303 citations
with Éva Tardos
Climate change policy: quantifying uncertainties for damages and optimal carbon taxes
published1999 · Energy Policy · 253 citations
with Stephen H. Schneider

Assembled from arXiv and OpenAlex. Duplicate records for the same paper are merged, and the published version is shown where we could identify one. Corrections welcome.