| Fast adaptive non-monotone submodular maximization subject to a knapsack constraint G Amanatidis, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser Advances in neural information processing systems 33, 16903-16915, 2020 | 54 | 2020 |
| Single-sample prophet inequalities via greedy-ordered selection C Caramanis, P Dütting, M Faw, F Fusco, P Lazos, S Leonardi, ... Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 38 | 2022 |
| Efficient two-sided markets with limited information P Dütting, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 38 | 2021 |
| An optimal truthful mechanism for the online weighted bipartite matching problem R Reiffenhauser Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 21 | 2019 |
| Allocating indivisible goods to strategic agents: Pure nash equilibria and fairness G Amanatidis, G Birmpas, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser Mathematics of operations research 49 (4), 2425-2445, 2024 | 20 | 2024 |
| Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity G Amanatidis, F Fusco, P Lazos, S Leonardi, A Marchetti-Spaccamela, ... International Conference on Machine Learning, 231-242, 2021 | 18 | 2021 |
| Truthful mechanism design via correlated tree rounding Y Azar, M Hoefer, I Maor, R Reiffenhäuser, B Vöcking Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 15 | 2015 |
| Round-robin beyond additive agents: Existence and fairness of approximate equilibria G Amanatidis, G Birmpas, P Lazos, S Leonardi, R Reiffenhäuser Proceedings of the 24th ACM Conference on Economics and Computation, 67-87, 2023 | 14 | 2023 |
| Prophet inequalities via the expected competitive ratio T Ezra, R Reiffenhauser, M Russo, A Tsigonias-Dimitriadis, S Leonardi ACM Transactions on Economics and Computation, 2022 | 7 | 2022 |
| Prophet inequalities for matching with a single sample P Dütting, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser arXiv preprint arXiv:2104.02050, 2021 | 6 | 2021 |
| Online combinatorial allocations and auctions with few samples P Dütting, T Kesselheim, B Lucier, R Reiffenhäuser, S Singla 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | 2 | 2024 |
| Pandora's Box Problem Over Time G Amanatidis, F Fusco, R Reiffenhäuser, A Tsikiridis arXiv preprint arXiv:2407.15261, 2024 | 2 | 2024 |
| Algorithmically fair maximization of multiple submodular objective functions G Amanatidis, G Birmpas, P Lazos, S Leonardi, R Reiffenhäuser arXiv preprint arXiv:2402.15155, 2024 | 2 | 2024 |
| Truthful matching with online items and offline agents M Feldman, F Fusco, S Leonardi, S Mauras, R Reiffenhäuser arXiv preprint arXiv:2211.02004, 2022 | 2 | 2022 |
| Optimal Stopping with Interdependent Values S Mauras, D Mohan, R Reiffenhäuser Proceedings of the 25th ACM Conference on Economics and Computation, 246-265, 2024 | 1 | 2024 |
| Truthful matching with online items and offline agents M Feldman, F Fusco, S Leonardi, S Mauras, R Reiffenhäuser Algorithmica 86 (5), 1600-1622, 2024 | 1 | 2024 |
| Trend Detection based Regret Minimization for Bandit Problems P Nakhe, R Reiffenhäuser 2016 IEEE International Conference on Data Science and Advanced Analytics …, 2016 | 1 | 2016 |
| Algorithmically Fair Maximization of Multiple Submodular Objective Functions G Birmpas, G Amanatidis, P Lazos, S Leonardi, R Reiffenhauser | | 2024 |
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness G Amanatidis, G Birmpas, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser Mathematics of Operations Research 49 (4), 2425-2445, 2024 | | 2024 |
| Solving Woeginger's hiking problem: wonderful partitions in anonymous hedonic games A Constantinescu, P Lenzner, R Reiffenhäuser, D Schmand, G Varricchio arXiv preprint arXiv:2311.02067, 2023 | | 2023 |
