Roughgarden, Tim

18 publications

COLT 2024 Online Stackelberg Optimization via Nonlinear Control William Brown, Christos Papadimitriou, Tim Roughgarden

ICML 2023 Formalizing Preferences over Runtime Distributions Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden

NeurIPS 2023 No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling Eric Neyman, Tim Roughgarden

NeurIPS 2023 Utilitarian Algorithm Configuration Devon Graham, Kevin Leyton-Brown, Tim Roughgarden

AAAI 2022 Strictly Proper Contract Functions Can Be Arbitrage-Free Eric Neyman, Tim Roughgarden

JMLR 2020 Optimal Algorithms for Continuous Non-Monotone Submodular and DR-Submodular Maximization Rad Niazadeh, Tim Roughgarden, Joshua R. Wang

NeurIPS 2020 Smoothed Analysis of Online and Differentially Private Learning Nika Haghtalab, Tim Roughgarden, Abhishek Shetty

COLT 2019 On the Computational Power of Online Gradient Descent Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang

COLT 2018 An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization Tim Roughgarden, Joshua R. Wang

NeurIPS 2018 Optimal Algorithms for Continuous Non-Monotone Submodular and DR-Submodular Maximization Rad Niazadeh, Tim Roughgarden, Joshua Wang

NeurIPS 2017 Online Prediction with Selfish Experts Tim Roughgarden, Okke Schrijvers

JAIR 2017 The Price of Anarchy in Auctions Tim Roughgarden, Vasilis Syrgkanis, Éva Tardos

COLT 2016 Learning Simple Auctions Jamie Morgenstern, Tim Roughgarden

IJCAI 2016 Why Prices Need Algorithms Tim Roughgarden, Inbal Talgam-Cohen

ICML 2015 How Hard Is Inference for Structured Prediction? Amir Globerson, Tim Roughgarden, David Sontag, Cafer Yildirim

NeurIPS 2015 On the Pseudo-Dimension of Nearly Optimal Auctions Jamie H Morgenstern, Tim Roughgarden

NeurIPS 2013 Marginals-to-Models Reducibility Tim Roughgarden, Michael Kearns

IJCAI 2011 Flexible Tree Matching Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer