Publications
In all my publications, the author names are ordered alphabetically. See also Google Scholar.
Conference Publications
- Multi-Agent Combinatorial Contracts
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim
SODA, 2025, to appear
arXiv preprint
- Sample Complexity of Posted Pricing for a Single Item
Billy Jin, Thomas Kesselheim, Will Ma, and Sahil Singla
NeurIPS, 2024, to appear
arXiv preprint
- Approximating Optimum Online for Capacitated Resource Allocation
Alexander Braun, Thomas Kesselheim, Tristan Pollner, and Amin Saberi
EC, 2024, to appear
arXiv preprint
- Online Combinatorial Allocations and Auctions with Few Samples
Paul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, and Sahil Singla
FOCS, 2024, to appear
arXiv preprint
- Bandit Algorithms for Prophet Inequality and Pandora’s Box
Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, and Yifan Wang
SODA, 2024, 462–500
arXiv preprint
- Supermodular Approximation of Norms and Applications
Thomas Kesselheim, Marco Molinaro, and Sahil Singla
STOC, 2024, 1841–1852
arXiv preprint
- Online and Bandit Algorithms Beyond ℓp Norms
Thomas Kesselheim, Marco Molinaro, and Sahil Singla
SODA, 2023, 1566–1593
arXiv preprint
- Simplified Prophet Inequalities for Combinatorial Auctions
Alexander Braun and Thomas Kesselheim
SOSA, 2023, 381–389
arXiv preprint
- Multi-agent Contracts
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim
STOC, 2023, 1311–1324
arXiv preprint
- Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions
Alexander Braun, Matthias Buttkus, and Thomas Kesselheim
ESA, 2021, 22:1–22:16
arXiv preprint
- Combinatorial Contracts
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim
FOCS, 2021, 815–826
arXiv preprint
- Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities
Alexander Braun and Thomas Kesselheim
EC, 2021, 202–203
arXiv preprint
- Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
Sepehr Assadi, Thomas Kesselheim, and Sahil Singla
SODA, 2021, 653–661
arXiv preprint
- Online Learning with Vector Costs and Bandits with Knapsacks
Thomas Kesselheim and Sahil Singla
COLT, 2020, 2286–2305
arXiv preprint
- An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions
Paul Dütting, Thomas Kesselheim, and Brendan Lucier
FOCS, 2020, 306–317
arXiv preprint
- Knapsack Secretary with Bursty Adversary
Thomas Kesselheim and Marco Molinaro
ICALP, 2020, 72:1–72:15
arXiv preprint
- Posted Pricing and Prophet Inequalities with Inaccurate Priors
Paul Dütting and Thomas Kesselheim
EC, 2019, 111–129
- How to Hire Secretaries with Stochastic Departures
Thomas Kesselheim, Alexandros Psomas, and Shai Vardi
WINE, 2019, 343
arXiv preprint
- Price of Anarchy for Mechanisms with Risk-Averse Agents
Thomas Kesselheim and Bojana Kodric
ICALP, 2018, 155:1–155:14
arXiv preprint
- Prophet Secretary for Combinatorial Auctions and Matroids
Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, and Sahil Singla
SODA, 2018, 700–714
arXiv preprint
- Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
Thomas Kesselheim and Andreas Tönnis
APPROX-RANDOM, 2017, 16:1–16:22
arXiv preprint
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs
Paul Duetting, Michal Feldman, Thomas Kesselheim, and Brendan Lucier
FOCS, 2017, 540–551
arXiv preprint
- Best-Response Dynamics in Combinatorial Auctions with Item Bidding
Paul Dütting and Thomas Kesselheim
SODA, 2017, 521–533
arXiv preprint
- Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
Thomas Kesselheim and Andreas Tönnis
ESA, 2016, 54:1–54:17
arXiv preprint
- Smoothness for Simultaneous Composition of Mechanisms with Admission
Martin Hoefer, Thomas Kesselheim, and Bojana Kodric
WINE, 2016, 294–308
arXiv preprint
- Online Appointment Scheduling in the Random Order Model
Oliver Göbel, Thomas Kesselheim, and Andreas Tönnis
ESA, 2015, 680–692
- Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round
Paul Dütting, Thomas Kesselheim, and Éva Tardos
EC, 2015, 187–201
arXiv preprint
- Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets
Thomas Kesselheim, Robert D Kleinberg, and Éva Tardos
EC, 2015, 203–220
- Algorithms against Anarchy: Understanding Non-Truthful Mechanisms
Paul Dütting and Thomas Kesselheim
EC, 2015, 239–255
- Secretary Problems with Non-Uniform Arrival Order
Thomas Kesselheim, Robert D Kleinberg, and Rad Niazadeh
STOC, 2015, 879–888
arXiv preprint
- Jamming-Resistant Learning in Wireless Networks
Johannes Dams, Martin Hoefer, and Thomas Kesselheim
ICALP (2), 2014, 447–458
arXiv preprint
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, and Berthold Vöcking
ICALP (2), 2014, 508–519
arXiv preprint
- Mechanism with unique learnable equilibria
Paul Dütting, Thomas Kesselheim, and Éva Tardos
EC, 2014, 877–894
- Primal beats dual on online packing LPs in the random-order model
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, and Berthold Vöcking
STOC, 2014, 303–312
arXiv preprint
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, and Berthold Vöcking
ESA, 2013, 589–600
- Truthfulness and stochastic dominance with monetary transfers
Martin Hoefer, Thomas Kesselheim, and Berthold Vöcking
EC, 2013, 567–582
- Brief announcement: universally truthful secondary spectrum auctions
Martin Hoefer and Thomas Kesselheim
SPAA, 2013, 99–101
arXiv preprint
- Sleeping Experts in Wireless Networks
Johannes Dams, Martin Hoefer, and Thomas Kesselheim
DISC, 2013, 344–357
- Approximation Algorithms for Wireless Spectrum Allocation with Power Control
Thomas Kesselheim
ALGOSENSORS, 2012, 1–3
- Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control
Lukas Belke, Thomas Kesselheim, Arie M C A Koster, and Berthold Vöcking
ALGOSENSORS, 2012, 30–41
- Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
Thomas Kesselheim
ESA, 2012, 659–670
arXiv preprint
- Dynamic packet scheduling in wireless networks
Thomas Kesselheim
PODC, 2012, 281–290
arXiv preprint
- Secondary spectrum auctions for symmetric and submodular bidders
Martin Hoefer and Thomas Kesselheim
EC, 2012, 657–671
arXiv preprint
- Scheduling in wireless networks with rayleigh-fading interference
Johannes Dams, Martin Hoefer, and Thomas Kesselheim
SPAA, 2012, 327–335
- Convergence Time of Power-Control Dynamics
Johannes Dams, Martin Hoefer, and Thomas Kesselheim
ICALP (2), 2011, 637–649
- A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model
Thomas Kesselheim
SODA, 2011, 1549–1559
arXiv preprint
- Approximation algorithms for secondary spectrum auctions
Martin Hoefer, Thomas Kesselheim, and Berthold Vöcking
SPAA, 2011, 177–186
arXiv preprint
- Brief announcement: distributed contention resolution in wireless networks
Thomas Kesselheim and Berthold Vöcking
PODC, 2010, 124–125
- Distributed Contention Resolution in Wireless Networks
Thomas Kesselheim and Berthold Vöcking
DISC, 2010, 163–178
- Improved Algorithms for Latency Minimization in Wireless Networks
Alexander Fanghänel, Thomas Keßelheim, and Berthold Vöcking
ICALP (2), 2009, 447–458
- Oblivious interference scheduling
Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, and Berthold Vöcking
PODC, 2009, 220–229
Theses
- PhD Thesis (RWTH Aachen University, 2012): Approximation Algorithms for Spectrum Allocation and Power Control in Wireless Networks [PDF]](http://publications.rwth-aachen.de/record/63041/files/4296.pdf)
- Diploma Thesis (RWTH Aachen University, 2009): Packet Scheduling with Interference