Thomas Kesselheim

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 51

Top Topics

Approximation Algorithms

Combinatorial Auctions

Independent Set

Top Venues

Publications

Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, Yifan Wang
Bandit Algorithms for Prophet Inequality and Pandora's Box. SODA (2024)
Alexander Braun, Thomas Kesselheim, Tristan Pollner, Amin Saberi
Approximating Optimum Online for Capacitated Resource Allocation. CoRR (2024)
Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Multi-Agent Combinatorial Contracts. CoRR (2024)
Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla
Sample Complexity of Posted Pricing for a Single Item. CoRR (2024)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Supermodular Approximation of Norms and Applications. STOC (2024)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Supermodular Approximation of Norms and Applications. CoRR (2024)
Alexander Braun, Thomas Kesselheim
Simplified Prophet Inequalities for Combinatorial Auctions. SOSA (2023)
Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Multi-agent Contracts. STOC (2023)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Norms. SODA (2023)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Norms. CoRR (2022)
Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, Yifan Wang
Bandit Algorithms for Prophet Inequality and Pandora's Box. CoRR (2022)
Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Combinatorial Contracts. FOCS (2022)
Paul Dütting, Thomas Kesselheim
Best-response dynamics in combinatorial auctions with item bidding. Games Econ. Behav. 134 (2022)
Alexander Braun, Thomas Kesselheim
Simplified Prophet Inequalities for Combinatorial Auctions. CoRR (2022)
Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Multi-Agent Contracts. CoRR (2022)
Alexander Braun, Thomas Kesselheim
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities. EC (2021)
Alexander Braun, Matthias Buttkus, Thomas Kesselheim
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. ESA (2021)
Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Combinatorial Contracts. CoRR (2021)
Sepehr Assadi, Thomas Kesselheim, Sahil Singla
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. SODA (2021)
Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Combinatorial Contracts. FOCS (2021)
Alexander Braun, Thomas Kesselheim
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities. CoRR (2021)
Alexander Braun, Matthias Buttkus, Thomas Kesselheim
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. CoRR (2021)
Paul Dütting, Thomas Kesselheim, Éva Tardos
Algorithms as Mechanisms: The Price of Anarchy of Relax and Round. Math. Oper. Res. 46 (1) (2021)
Thomas Kesselheim, Marco Molinaro
Knapsack Secretary with Bursty Adversary. ICALP (2020)
Thomas Kesselheim, Sahil Singla
Online Learning with Vector Costs and Bandits with Knapsacks. COLT (2020)
Sepehr Assadi, Thomas Kesselheim, Sahil Singla
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. CoRR (2020)
Thomas Kesselheim, Marco Molinaro
Knapsack Secretary with Bursty Adversary. CoRR (2020)
Paul Dütting, Thomas Kesselheim, Brendan Lucier
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. FOCS (2020)
Paul Dütting, Thomas Kesselheim, Brendan Lucier
An O(log log m) prophet inequality for subadditive combinatorial auctions. SIGecom Exch. 18 (2) (2020)
Thomas Kesselheim, Sahil Singla
Online Learning with Vector Costs and Bandits with Knapsacks. CoRR (2020)
Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs. SIAM J. Comput. 49 (3) (2020)
Paul Dütting, Thomas Kesselheim, Brendan Lucier
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. CoRR (2020)
Paul Dütting, Thomas Kesselheim
Posted Pricing and Prophet Inequalities with Inaccurate Priors. EC (2019)
Thomas Kesselheim, Alexandros Psomas, Shai Vardi
How to Hire Secretaries with Stochastic Departures. CoRR (2019)
Thomas Kesselheim, Alexandros Psomas, Shai Vardi
How to Hire Secretaries with Stochastic Departures. WINE (2019)
Thomas Kesselheim, Bojana Kodric
Price of Anarchy for Mechanisms with Risk-Averse Agents. ICALP (2018)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
Primal Beats Dual on Online Packing LPs in the Random-Order Model. SIAM J. Comput. 47 (5) (2018)
Thomas Kesselheim, Bojana Kodric
Price of Anarchy for Mechanisms with Risk-Averse Agents. CoRR (2018)
Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla
Prophet Secretary for Combinatorial Auctions and Matroids. SODA (2018)
Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla
Prophet Secretary for Combinatorial Auctions and Matroids. CoRR (2017)
Paul Duetting, Michal Feldman, Thomas Kesselheim, Brendan Lucier
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs. FOCS (2017)
Thomas Kesselheim, Andreas Tönnis
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. APPROX-RANDOM (2017)
Paul Dütting, Thomas Kesselheim
Best-Response Dynamics in Combinatorial Auctions with Item Bidding. SODA (2017)
Thomas Kesselheim, Andreas Tönnis
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. CoRR (2016)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Truthfulness and Stochastic Dominance with Monetary Transfers. ACM Trans. Economics and Comput. 4 (2) (2016)
Thomas Kesselheim, Andreas Tönnis
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. CoRR (2016)
Martin Hoefer, Thomas Kesselheim, Bojana Kodric
Smoothness for Simultaneous Composition of Mechanisms with Admission. WINE (2016)
Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier
Posted Prices, Smoothness, and Combinatorial Prophet Inequalities. CoRR (2016)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Jamming-Resistant Learning in Wireless Networks. IEEE/ACM Trans. Netw. 24 (5) (2016)
Paul Dütting, Thomas Kesselheim
Best-Response Dynamics in Combinatorial Auctions with Item Bidding. CoRR (2016)
Thomas Kesselheim, Andreas Tönnis
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. ESA (2016)
Martin Hoefer, Thomas Kesselheim
Secondary Spectrum Auctions for Symmetric and Submodular Bidders. ACM Trans. Economics and Comput. 3 (2) (2015)
Thomas Kesselheim, Robert D. Kleinberg, Éva Tardos
Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets. EC (2015)
Martin Hoefer, Thomas Kesselheim, Bojana Kodric
Smoothness for Simultaneous Composition of Mechanisms with Admission. CoRR (2015)
Paul Dütting, Thomas Kesselheim
Algorithms against Anarchy: Understanding Non-Truthful Mechanisms. EC (2015)
Paul Dütting, Thomas Kesselheim, Éva Tardos
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. EC (2015)
Paul Dütting, Thomas Kesselheim, Éva Tardos
Algorithms as mechanisms: the price of anarchy of relax-and-round. SIGecom Exch. 14 (2) (2015)
Paul Dütting, Thomas Kesselheim, Éva Tardos
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. CoRR (2015)
Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh
Secretary Problems with Non-Uniform Arrival Order. STOC (2015)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Scheduling in Wireless Networks with Rayleigh-Fading Interference. IEEE Trans. Mob. Comput. 14 (7) (2015)
Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh
Secretary Problems with Non-Uniform Arrival Order. CoRR (2015)
Oliver Göbel, Thomas Kesselheim, Andreas Tönnis
Online Appointment Scheduling in the Random Order Model. ESA (2015)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Approximation Algorithms for Secondary Spectrum Auctions. ACM Trans. Internet Techn. 14 (2-3) (2014)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Jamming-Resistant Learning in Wireless Networks. ICALP (2) (2014)
Paul Dütting, Thomas Kesselheim, Éva Tardos
Mechanism with unique learnable equilibria. EC (2014)
Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP (2) (2014)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
Primal beats dual on online packing LPs in the random-order model. STOC (2014)
Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. 553 (2014)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Truthfulness and stochastic dominance with monetary transfers. EC (2013)
Martin Hoefer, Thomas Kesselheim
Universally Truthful Secondary Spectrum Auctions CoRR (2013)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
Primal Beats Dual on Online Packing LPs in the Random-Order Model. CoRR (2013)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Jamming-Resistant Learning in Wireless Networks. CoRR (2013)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. ESA (2013)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Sleeping Experts in Wireless Networks. DISC (2013)
Martin Hoefer, Thomas Kesselheim
Brief announcement: universally truthful secondary spectrum auctions. SPAA (2013)
Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. CoRR (2013)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Convergence Time of Power-Control Dynamics. IEEE J. Sel. Areas Commun. 30 (11) (2012)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Scheduling in wireless networks with rayleigh-fading interference. SPAA (2012)
Thomas Kesselheim
Approximation Algorithms for Wireless Spectrum Allocation with Power Control. ALGOSENSORS (2012)
Thomas Kesselheim
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates CoRR (2012)
Thomas Kesselheim
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates. ESA (2012)
Thomas Kesselheim
Dynamic packet scheduling in wireless networks. PODC (2012)
Thomas Kesselheim
Dynamic Packet Scheduling in Wireless Networks CoRR (2012)
Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS (2012)
Martin Hoefer, Thomas Kesselheim
Secondary spectrum auctions for symmetric and submodular bidders. EC (2012)
Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking
Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. 412 (24) (2011)
Martin Hoefer, Thomas Kesselheim
Secondary Spectrum Auctions for Symmetric and Submodular Bidders CoRR (2011)
Thomas Kesselheim
A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. SODA (2011)
Johannes Dams, Martin Hoefer, Thomas Kesselheim
Convergence Time of Power-Control Dynamics. ICALP (2) (2011)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Approximation algorithms for secondary spectrum auctions. SPAA (2011)
Thomas Kesselheim, Berthold Vöcking
Distributed Contention Resolution in Wireless Networks. DISC (2010)
Thomas Kesselheim
A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model CoRR (2010)
Thomas Kesselheim, Berthold Vöcking
Brief announcement: distributed contention resolution in wireless networks. PODC (2010)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Approximation Algorithms for Secondary Spectrum Auctions CoRR (2010)
Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking
Oblivious interference scheduling. PODC (2009)