I am a Senior Research Scientist at Google Switzerland. Before joining Google, I was an Associate Professor in the Department of Mathematics at London School of Economics, where I still hold a role as visiting faculty. I work on problems at the intersection of Algorithms, Game Theory, Contract Theory, and Mechanism Design.

I received my PhD in Computer Science from EPFL Lausanne. My PhD advisor was Monika Henzinger. During my PhD I visited David Parkes at Harvard University, and I did a summer internship at Google. Afterwards, I was a Postdoctoral Researcher with Tim Roughgarden at Stanford University and Éva Tardos at Cornell University, an LSE Fellow in Mathematics at London School of Economics, and a Senior Researcher at ETH Zürich.

I am an alumnus of both the German and the Swiss National Academic Foundation. I have been awarded a Best Full Paper Award at EC 2019 and a Best Paper Award at EC 2012. I am one of the winners of the 2017/18 LSE Excellence in Education Awards.

News

• [September 2023] Our paper Optimal Auctions through Deep Learning: Advances in Differentiable Economics was accepted for publication in the Journal of the ACM.
• [September 2023] Our paper Deep Contract Design via Discontinuos Networks was accepted to NeurIPS 2023.

Selected publications

Deep Contract Design via Discontinuos Networks
Tonghan Wang, Paul Dütting, Dimitry Ivanov, Inbal Talgam-Cohen, David Parkes
Conference on Neural Information Processing Systems, NeurIPS 2023, New Orleans, LA, USA
[arXiv]
Multi-Agent Contracts
Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA
[pdf | arXiv | BibTex]
Combinatorial Contracts
Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
IEEE Symposium on Foundations of Computer Science, FOCS 2021, Boulder, CO, USA (virtual)
[pdf | arXiv | BibTex]
Efficient Two-Sided Markets with Limited Information
Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
ACM Symposium on Theory of Computing, STOC 2021, Rome, Italy (virtual)
[pdf | arXiv | BibTex]
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions
Paul Dütting, Thomas Kesselheim, Brendan Lucier
IEEE Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA (virtual)
[pdf | arXiv | ACM SIGecom Exchanges | BibTex]
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution
(ACM SIGecom Best Full Paper Award)
Jose Correa, Paul Dütting, Felix Fischer, Kevin Schewior
ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA
[pdf | arXiv | BibTex]
The Complexity of Contracts
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA
[pdf | arXiv | BibTex
Simple versus Optimal Contracts
Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen
ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA
[pdf | arXiv | BibTex]
Optimal Auctions through Deep Leaning
Paul Dütting, Zhe Feng, Hari Narasimhan, David C. Parkes, Sai S. Ravindranath
International Conference on Machine Learning, ICML 2019, Long Beach, CA, USA (long presentation)
[pdf | code | arXiv | BibTex]
Prophet Inequalities made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs
Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier
IEEE Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA
[pdf | arXiv | BibTex]

Check out full list of publications.