Paul Dütting

Orcid: 0000-0002-0635-6812

Affiliations:
  • Google Research, Switzerland


According to our database1, Paul Dütting authored at least 67 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Secretaries with Advice.
Math. Oper. Res., 2024

Nontruthful Position Auctions Are More Robust to Misspecification.
Math. Oper. Res., 2024

Optimal Auctions through Deep Learning: Advances in Differentiable Economics.
J. ACM, 2024

Multi-Agent Combinatorial Contracts.
CoRR, 2024

The Query Complexity of Contracts.
CoRR, 2024

The Competition Complexity of Prophet Inequalities.
CoRR, 2024

Mechanism Design for Large Language Models.
Proceedings of the ACM on Web Conference 2024, 2024

Combinatorial Contracts Beyond Gross Substitutes.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Deep Contract Design via Discontinuous Piecewise Affine Neural Networks.
CoRR, 2023

Multi-agent Contracts.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Prophet Secretary Against the Online Optimal.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Ambiguous Contracts.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Trading Prophets.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Bayesian Analysis of Linear Contracts.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Deep Contract Design via Discontinuous Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimal No-Regret Learning for One-Sided Lipschitz Functions.
Proceedings of the International Conference on Machine Learning, 2023

Fully Dynamic Submodular Maximization over Matroids.
Proceedings of the International Conference on Machine Learning, 2023

2022
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution.
Math. Oper. Res., 2022

Best-response dynamics in combinatorial auctions with item bidding.
Games Econ. Behav., 2022

Deletion Robust Non-Monotone Submodular Maximization over Matroids.
CoRR, 2022

Price Manipulability in First-Price Auctions.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Calibrated Click-Through Auctions.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Single-Sample Prophet Inequalities via Greedy-Ordered Selection.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Competition Complexity of Dynamic Pricing.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Deletion Robust Submodular Maximization over Matroids.
Proceedings of the International Conference on Machine Learning, 2022

2021
The Complexity of Contracts.
SIAM J. Comput., 2021

Calibrated Click-Through Auctions: An Information Design Approach.
CoRR, 2021

Prophet Inequalities for Matching with a Single Sample.
CoRR, 2021

Optimal auctions through deep learning.
Commun. ACM, 2021

Efficient two-sided markets with limited information.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Contracts with Private Cost per Unit-of-Effort.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Fairness and Bias in Online Selection.
Proceedings of the 38th International Conference on Machine Learning, 2021

Combinatorial Contracts.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
An O(log log m) prophet inequality for subadditive combinatorial auctions.
SIGecom Exch., 2020

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs.
SIAM J. Comput., 2020

Streaming Algorithms for Online Selection Problems.
CoRR, 2020

2019
Expressiveness and Robustness of First-Price Position Auctions.
Math. Oper. Res., 2019

Simple versus Optimal Contracts.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Posted Pricing and Prophet Inequalities with Inaccurate Priors.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Valuation Compressions in VCG-Based Combinatorial Auctions.
ACM Trans. Economics and Comput., 2018

Prophet Inequalities for Independent Random Variables from an Unknown Distribution.
CoRR, 2018

2017
The Performance of Deferred-Acceptance Auctions.
Math. Oper. Res., 2017

Modularity and greed in double auctions.
Games Econ. Behav., 2017

Game Theory Meets Computational Learning Theory (Dagstuhl Seminar 17251).
Dagstuhl Reports, 2017

Optimal Auctions through Deep Learning.
CoRR, 2017

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Posted Prices, Smoothness, and Combinatorial Prophet Inequalities.
CoRR, 2016

Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing.
CoRR, 2016

Truthful Outcomes from Non-Truthful Position Auctions.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
An Expressive Mechanism for Auctions on the Web.
ACM Trans. Economics and Comput., 2015

Auctions for Heterogeneous Items and Budget Limits.
ACM Trans. Economics and Comput., 2015

Payment Rules through Discriminant-Based Classifiers.
ACM Trans. Economics and Comput., 2015

Algorithms as mechanisms: the price of anarchy of relax-and-round.
SIGecom Exch., 2015

Algorithms against Anarchy: Understanding Non-Truthful Mechanisms.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Polymatroid Prophet Inequalities.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Mechanism with unique learnable equilibria.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
Challenges in Algorithmic Mechanism Design.
PhD thesis, 2013

Bidder optimal assignments for general utilities.
Theor. Comput. Sci., 2013

Sponsored search, market equilibria, and the Hungarian Method.
Inf. Process. Lett., 2013

2012
Maximizing revenue from strategic recommendations under decaying trust.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Offline file assignments for online load balancing.
Inf. Process. Lett., 2011

Simplicity-expressiveness tradeoffs in mechanism design.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
How much is your personal recommendation worth?
Proceedings of the 19th International Conference on World Wide Web, 2010

Mechanisms for the Marriage and the Assignment Game.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
On the Pricing of Recommendations and Recommending Strategically
CoRR, 2009


  Loading...