Thomas Kesselheim

From MaRDI portal
Person:541671

Available identifiers

zbMath Open kesselheim.thomasMaRDI QIDQ541671

List of research outcomes





PublicationDate of PublicationType
Technical note -- On hiring secretaries with stochastic departures2024-12-20Paper
Bandit algorithms for Prophet Inequality and Pandora's Box2024-11-28Paper
Prophet secretary for combinatorial auctions and matroids2024-11-20Paper
Online and bandit algorithms beyond \(\ell_p\) norms2024-05-14Paper
Simplified prophet inequalities for combinatorial auctions2024-05-14Paper
Multi-agent contracts2024-05-08Paper
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities2024-03-01Paper
https://portal.mardi4nfdi.de/entity/Q61472892024-01-15Paper
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions2023-09-20Paper
Best-response dynamics in combinatorial auctions with item bidding2022-07-15Paper
An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions2022-06-08Paper
Submodular secretary problems: cardinality, matching, and linear constraints2021-07-28Paper
Price of Anarchy for Mechanisms with Risk-Averse Agents2021-07-28Paper
Algorithms as mechanisms: the price of anarchy of relax and round2021-06-03Paper
Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs2020-08-03Paper
Primal beats dual on online packing LPs in the random-order model2018-11-07Paper
Best-response dynamics in combinatorial auctions with item bidding2018-07-16Paper
Prophet secretary for combinatorial auctions and matroids2018-03-15Paper
Think eternally: improved algorithms for the temp secretary problem and extensions2018-03-02Paper
A constant-factor approximation for wireless capacity maximization with power control in the SINR model2017-09-29Paper
Smoothness for Simultaneous Composition of Mechanisms with Admission2017-02-10Paper
Online appointment scheduling in the random order model2015-11-19Paper
Secretary Problems with Non-Uniform Arrival Order2015-08-21Paper
Primal beats dual on online packing LPs in the random-order model2015-06-26Paper
Dynamic packet scheduling in wireless networks2014-12-05Paper
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control2014-09-18Paper
Oblivious interference scheduling2014-07-23Paper
Jamming-resistant learning in wireless networks2014-07-01Paper
Online independent set beyond the worst-case: secretaries, prophets, and periods2014-07-01Paper
An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions2013-09-17Paper
Approximation algorithms for wireless link scheduling with flexible data rates2012-09-25Paper
Convergence time of power-control dynamics2011-07-07Paper
Improved algorithms for latency minimization in wireless networks2011-06-07Paper
Distributed contention resolution in wireless networks2010-09-10Paper
Improved Algorithms for Latency Minimization in Wireless Networks2009-07-14Paper

Research outcomes over time

This page was built for person: Thomas Kesselheim