Thomas Kesselheim

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Online and Bandit Algorithms Beyond ℓp Norms.

[BibT_eX]

[DOI]

Marco Molinaro

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Best-response dynamics in combinatorial auctions with item bidding.

[BibT_eX]

[DOI]

Games Econ. Behav., 2022

Online and Bandit Algorithms Beyond 𝓁p Norms.

[BibT_eX]

[DOI]

Marco Molinaro

CoRR, 2022

2021

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier.

[BibT_eX]

[DOI]

Sepehr Assadi

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities.

[BibT_eX]

[DOI]

Alexander Braun

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Combinatorial Contracts.

[BibT_eX]

[DOI]

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

Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions.

[BibT_eX]

[DOI]

Alexander Braun

Matthias Buttkus

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

An O(log log m) prophet inequality for subadditive combinatorial auctions.

[BibT_eX]

[DOI]

Brendan Lucier

SIGecom Exch., 2020

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Knapsack Secretary with Bursty Adversary.

[BibT_eX]

[DOI]

Marco Molinaro

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Online Learning with Vector Costs and Bandits with Knapsacks.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

2019

How to Hire Secretaries with Stochastic Departures.

[BibT_eX]

[DOI]

Alexandros Psomas

Shai Vardi

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Posted Pricing and Prophet Inequalities with Inaccurate Priors.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Primal Beats Dual on Online Packing LPs in the Random-Order Model.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Prophet Secretary for Combinatorial Auctions and Matroids.

[BibT_eX]

[DOI]

Soheil Ehsani

MohammadTaghi Hajiaghayi

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Price of Anarchy for Mechanisms with Risk-Averse Agents.

[BibT_eX]

[DOI]

Bojana Kodric

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints.

[BibT_eX]

[DOI]

Andreas Tönnis

Proceedings of the Approximation, 2017

2016

Jamming-Resistant Learning in Wireless Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Truthfulness and Stochastic Dominance with Monetary Transfers.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Posted Prices, Smoothness, and Combinatorial Prophet Inequalities.

[BibT_eX]

[DOI]

CoRR, 2016

Smoothness for Simultaneous Composition of Mechanisms with Admission.

[BibT_eX]

[DOI]

Bojana Kodric

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions.

[BibT_eX]

[DOI]

Andreas Tönnis

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Scheduling in Wireless Networks with Rayleigh-Fading Interference.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2015

Secondary Spectrum Auctions for Symmetric and Submodular Bidders.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Algorithms as mechanisms: the price of anarchy of relax-and-round.

[BibT_eX]

[DOI]

Éva Tardos

SIGecom Exch., 2015

Secretary Problems with Non-Uniform Arrival Order.

[BibT_eX]

[DOI]

Robert D. Kleinberg

Rad Niazadeh

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets.

[BibT_eX]

[DOI]

Robert D. Kleinberg

Éva Tardos

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Algorithms against Anarchy: Understanding Non-Truthful Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Online Appointment Scheduling in the Random Order Model.

[BibT_eX]

[DOI]

Oliver Göbel

Andreas Tönnis

Proceedings of the Algorithms - ESA 2015, 2015

2014

Approximation Algorithms for Secondary Spectrum Auctions.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2014

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Mechanism with unique learnable equilibria.

[BibT_eX]

[DOI]

Éva Tardos

Proceedings of the ACM Conference on Economics and Computation, 2014

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Universally Truthful Secondary Spectrum Auctions

[BibT_eX]

[DOI]

CoRR, 2013

Sleeping Experts in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Brief announcement: universally truthful secondary spectrum auctions.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Approximation algorithms for spectrum allocation and power control in wireless networks.

[BibT_eX]

[DOI]

Thomas Keßelheim

PhD thesis, 2012

Convergence Time of Power-Control Dynamics.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2012

Dynamic packet scheduling in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Approximationsalgorithmen für Spektrumsallokation und Power Control in Funknetzwerken.

[BibT_eX]

[DOI]

Thomas Keßelheim

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Approximation Algorithms for Wireless Spectrum Allocation with Power Control.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2012

2011

Improved algorithms for latency minimization in wireless networks.

[BibT_eX]

[DOI]

Alexander Fanghänel

Theor. Comput. Sci., 2011

A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Distributed Contention Resolution in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: distributed contention resolution in wireless networks.

[BibT_eX]

[DOI]