Rebecca Reiffenhauser
assegnista di ricerca
stanza:
B118
Membro di
Awards
Ultime pubblicazioni
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness on Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2022 |
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness on Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2022 |
| Single-Sample Prophet Inequalities via Greedy-Ordered Selection on Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) | 2022 |
| Efficient two-sided markets with limited information on STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2021 |
| Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity on Proceedings of the 38th International Conference on Machine Learning | 2021 |
| Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint on 34th Conference on Neural Information Processing Systems, NeurIPS 2020 | 2020 |
| An Optimal Truthful Mechanism for the Online Weighted bipartite Matching Problem on Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms | 2019 |