| Publication | Date of Publication | Type |
|---|
Technical note -- On hiring secretaries with stochastic departures
Operations Research | 2024-12-20 | Paper |
| Bandit algorithms for Prophet Inequality and Pandora's Box | 2024-11-28 | Paper |
Prophet secretary for combinatorial auctions and matroids
SIAM Journal on Computing | 2024-11-20 | Paper |
| Online and bandit algorithms beyond \(\ell_p\) norms | 2024-05-14 | Paper |
| Simplified prophet inequalities for combinatorial auctions | 2024-05-14 | Paper |
| Multi-agent contracts | 2024-05-08 | Paper |
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities
Mathematics of Operations Research | 2024-03-01 | Paper |
scientific article; zbMATH DE number 7788378 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions
(available as arXiv preprint) | 2023-09-20 | Paper |
Best-response dynamics in combinatorial auctions with item bidding
Games and Economic Behavior | 2022-07-15 | Paper |
An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
SIAM Journal on Computing | 2022-06-08 | Paper |
Submodular secretary problems: cardinality, matching, and linear constraints
(available as arXiv preprint) | 2021-07-28 | Paper |
Price of Anarchy for Mechanisms with Risk-Averse Agents
(available as arXiv preprint) | 2021-07-28 | Paper |
Algorithms as mechanisms: the price of anarchy of relax and round
Mathematics of Operations Research | 2021-06-03 | Paper |
Algorithms as mechanisms: the price of anarchy of relax and round
Mathematics of Operations Research | 2021-06-03 | Paper |
Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
SIAM Journal on Computing | 2020-08-03 | Paper |
Primal beats dual on online packing LPs in the random-order model
SIAM Journal on Computing | 2018-11-07 | Paper |
Best-response dynamics in combinatorial auctions with item bidding
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Prophet secretary for combinatorial auctions and matroids | 2018-03-15 | Paper |
Prophet secretary for combinatorial auctions and matroids
(available as arXiv preprint) | 2018-03-15 | Paper |
Think eternally: improved algorithms for the temp secretary problem and extensions
(available as arXiv preprint) | 2018-03-02 | Paper |
| A constant-factor approximation for wireless capacity maximization with power control in the SINR model | 2017-09-29 | Paper |
A constant-factor approximation for wireless capacity maximization with power control in the SINR model
(available as arXiv preprint) | 2017-09-29 | Paper |
Smoothness for Simultaneous Composition of Mechanisms with Admission
Web and Internet Economics | 2017-02-10 | Paper |
Online appointment scheduling in the random order model
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Secretary Problems with Non-Uniform Arrival Order
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Primal beats dual on online packing LPs in the random-order model
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Dynamic packet scheduling in wireless networks
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
Theoretical Computer Science | 2014-09-18 | Paper |
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Jamming-resistant learning in wireless networks
Automata, Languages, and Programming | 2014-07-01 | Paper |
Online independent set beyond the worst-case: secretaries, prophets, and periods
Automata, Languages, and Programming | 2014-07-01 | Paper |
An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Approximation algorithms for wireless link scheduling with flexible data rates
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Convergence time of power-control dynamics
Automata, Languages and Programming | 2011-07-07 | Paper |
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science | 2011-06-07 | Paper |
Distributed contention resolution in wireless networks
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Improved Algorithms for Latency Minimization in Wireless Networks
Automata, Languages and Programming | 2009-07-14 | Paper |
