Dütting, Paul; Kesselheim, Thomas Best-response dynamics in combinatorial auctions with item bidding. (English) Zbl 1497.91136 Games Econ. Behav. 134, 428-448 (2022). MSC: 91B26 91A86 PDFBibTeX XMLCite \textit{P. Dütting} and \textit{T. Kesselheim}, Games Econ. Behav. 134, 428--448 (2022; Zbl 1497.91136) Full Text: DOI Link
Dütting, Paul; Kesselheim, Thomas; Lucier, Brendan An \(O(\log \log m)\) prophet inequality for subadditive combinatorial auctions. (English) Zbl 07538270 SIAM J. Comput. 51, No. 3, FOCS20-239-FOCS20-275 (2022). MSC: 68Q25 68W27 60G40 PDFBibTeX XMLCite \textit{P. Dütting} et al., SIAM J. Comput. 51, No. 3, FOCS20--239-FOCS20--275 (2022; Zbl 07538270) Full Text: DOI arXiv
Dütting, Paul; Kesselheim, Thomas; Tardos, Éva Algorithms as mechanisms: the price of anarchy of relax and round. (English) Zbl 1466.91071 Math. Oper. Res. 46, No. 1, 317-335 (2021). MSC: 91B03 91A68 91B26 PDFBibTeX XMLCite \textit{P. Dütting} et al., Math. Oper. Res. 46, No. 1, 317--335 (2021; Zbl 1466.91071) Full Text: DOI arXiv Link
Dütting, Paul; Feldman, Michal; Kesselheim, Thomas; Lucier, Brendan Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs. (English) Zbl 1454.91090 SIAM J. Comput. 49, No. 3, 540-582 (2020). MSC: 91B24 60G40 93E20 68W27 PDFBibTeX XMLCite \textit{P. Dütting} et al., SIAM J. Comput. 49, No. 3, 540--582 (2020; Zbl 1454.91090) Full Text: DOI arXiv
Kesselheim, Thomas; Radke, Klaus; Tönnis, Andreas; Vöcking, Berthold Primal beats dual on online packing LPs in the random-order model. (English) Zbl 1411.90216 SIAM J. Comput. 47, No. 5, 1939-1964 (2018). MSC: 90C08 68Q25 68W27 PDFBibTeX XMLCite \textit{T. Kesselheim} et al., SIAM J. Comput. 47, No. 5, 1939--1964 (2018; Zbl 1411.90216) Full Text: DOI
Kesselheim, Thomas; Tönnis, Andreas Submodular secretary problems: cardinality, matching, and linear constraints. (English) Zbl 1467.68225 Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 16, 22 p. (2017). MSC: 68W27 68W20 90C27 PDFBibTeX XMLCite \textit{T. Kesselheim} and \textit{A. Tönnis}, LIPIcs -- Leibniz Int. Proc. Inform. 81, Article 16, 22 p. (2017; Zbl 1467.68225) Full Text: DOI arXiv
Hoefer, Martin; Kesselheim, Thomas; Kodric, Bojana Smoothness for simultaneous composition of mechanisms with admission. (English) Zbl 1404.91025 Cai, Yang (ed.) et al., Web and internet economics. 12th international conference, WINE 2016, Montreal, Canada, December 11–14, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-54109-8/pbk; 978-3-662-54110-4/ebook). Lecture Notes in Computer Science 10123, 294-308 (2016). MSC: 91A20 91A26 91B15 PDFBibTeX XMLCite \textit{M. Hoefer} et al., Lect. Notes Comput. Sci. 10123, 294--308 (2016; Zbl 1404.91025) Full Text: DOI arXiv
Göbel, Oliver; Kesselheim, Thomas; Tönnis, Andreas Online appointment scheduling in the random order model. (English) Zbl 1466.90033 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 680-692 (2015). MSC: 90B35 68W27 PDFBibTeX XMLCite \textit{O. Göbel} et al., Lect. Notes Comput. Sci. 9294, 680--692 (2015; Zbl 1466.90033) Full Text: DOI