Pubblicazioni di Reiffenhauser Rebecca
2023
Feldman Michal, Fusco Federico, Simon Mauras, Reiffenhauser REBECCA EVA MARIA
Truthful Matching with Online Items and Offline Agents. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) 2023: -
2022
Amanatidis G., Birmpas G., Fusco F., Lazos Filippos., Leonardi S., Reiffenhauser R.
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2022: 149-166
Amanatidis Georgios, Fusco Federico, Lazos Filippos, Leonardi Stefano, Reiffenhauser REBECCA EVA MARIA
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. THE JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2022: 661-690
Caramanis Constantine, Dütting Paul, Faw Matthew, Fusco Federico, Lazos Filippos, Leonardi Stefano, Papadigenopoulos Orestis, Pountourakis Emmanouil, Reiffenhäuser Rebecca
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022: 1298-1325
2021
Dütting Paul, Fusco Federico, Lazos Filippos, Leonardi Stefano, Reiffenhäuser Rebecca
Efficient two-sided markets with limited information. STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing 2021: 1452-1465
Amanatidis Georgios, Fusco Federico, Lazos Filippos, Leonardi Stefano, Marchetti-Spaccamela Alberto, Rebecca Reiffenhäuser
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. Proceedings of the 38th International Conference on Machine Learning 2021: 231-242
2019
Reiffenhauser R.
An Optimal Truthful Mechanism for the Online Weighted bipartite Matching Problem. Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms 2019: 1982-1993