Rebecca Reiffenhäuser

Orcid: 0000-0002-0959-2589

According to our database1, Rebecca Reiffenhäuser authored at least 15 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Truthful Matching with Online Items and Offline Agents.
Algorithmica, May, 2024

Algorithmically Fair Maximization of Multiple Submodular Objective Functions.
CoRR, 2024

2023
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games.
CoRR, 2023

Prophet Inequalities via the Expected Competitive Ratio.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Truthful Matching with Online Items and Offline Agents.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
J. Artif. Intell. Res., 2022

Single-Sample Prophet Inequalities via Greedy-Ordered Selection.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Prophet Inequalities for Matching with a Single Sample.
CoRR, 2021

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Efficient two-sided markets with limited information.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.
Proceedings of the 38th International Conference on Machine Learning, 2021

2019
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2017
Truthful mechanism design via correlated tree rounding.
Math. Program., 2017

2016
Trend Detection Based Regret Minimization for Bandit Problems.
Proceedings of the 2016 IEEE International Conference on Data Science and Advanced Analytics, 2016


  Loading...