Voor de beste ervaring schakelt u JavaScript in en gebruikt u een moderne browser!
Je gebruikt een niet-ondersteunde browser. Deze site kan er anders uitzien dan je verwacht.

Dr. rer. nat. R.E.M. (Rebecca) Reiffenhäuser

Faculteit der Natuurwetenschappen, Wiskunde en Informatica
ILLC
Bezoekadres
  • Science Park 900
Postadres
  • Postbus 94242
    1090 GE Amsterdam
Contactgegevens
  • Publicaties

    2024

    • Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2024). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. Mathematics of operations research, 49(4), 2425-2445. https://doi.org/10.1287/moor.2022.0058 [details]
    • Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2024). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. Mathematics of operations research. Advance online publication. https://doi.org/10.1287/moor.2023.0244
    • Constantinescu, A., Lenzner, P., Reiffenhäuser, R., Schmand, D., & Varricchio, G. (2024). Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. In K. Bringmann, M. Grohe, G. Puppis, & O. Svensson (Eds.), 51st International Colloquium on Automata, Languages, and Programming: ICALP 2024, July 8-12, 2024, Tallinn, Estonia Article 48 (Leibniz International Proceedings in Informatics; Vol. 297). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2024.48 [details]
    • Dütting, P., Kesselheim, T., Lucier, B., Reiffenhäuser, R., & Singla, S. (2024). Online Combinatorial Allocations and Auctions with Few Samples. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science : FOCS 2024: 27-30 October 2024, Chicago, United States : proceedings (pp. 1231-1250). IEEE Computer Society Press. https://doi.org/10.1109/FOCS61266.2024.00081 [details]
    • Ezra, T., Leonardi, S., Reiffenhäuser, R., Russo, M., & Tsigonias-Dimitriadis, A. (2024). Prophet Inequalities via the Expected Competitive Ratio. In J. Garg, M. Klimm, & Y. Kong (Eds.), Web and Internet Economics: 19th International Conference, WINE 2023, Shanghai, China, December 4–8, 2023 : proceedings (pp. 272-289). (Lecture Notes in Computer Science; Vol. 14413), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-031-48974-7_16 [details]
    • Feldman, M., Fusco, F., Leonardi, S., Mauras, S., & Reiffenhäuser, R. (2024). Truthful Matching with Online Items and Offline Agents. Algorithmica, 86(5), 1600–1622. https://doi.org/10.1007/s00453-023-01202-3 [details]
    • Mauras, S., Mohan, D., & Reiffenhäuser, R. (2024). Optimal Stopping with Interdependent Values. In EC '24: Proceedings of the 25th ACM Conference on Economics and Computation : July 8-11, 2024, New Haven, CT, USA (pp. 246-265). The Association for Computing Machinery. https://doi.org/10.1145/3670865.3673628 [details]

    2023

    • Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2023). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. In EC 2023: Proceedings of the 24th ACM Conference on Economics and Computation) : July 9-12, 2023, London, United Kingdom (pp. 67-87). Association for Computing Machinery. https://doi.org/10.1145/3580507.3597796 [details]
    • Feldman, M., Fusco, F., Mauras, S., & Reiffenhäuser, R. (2023). Truthful Matching with Online Items and Offline Agents. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming: ICALP 2023, July 10-14, 2023, Paderborn, Germany Article 58 (Leibniz International Proceedings in Informatics; Vol. 261). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.58 [details]

    2022

    • Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2022). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. In M. Feldman, H. Fu, & I. Talgam-Cohen (Eds.), Web and Internet Economics: 17th International Conference, WINE 2021, Potsdam, Germany, December 14–17, 2021 : proceedings (pp. 149-166). (Lecture Notes in Computer Science; Vol. 13112). Springer. https://doi.org/10.1007/978-3-030-94676-0_9
    • Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2022). Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. Journal of Artificial Intelligence Research, 74, 661-690. https://doi.org/10.1613/JAIR.1.13472
    • Caramanis, C., Dütting, P., Faw, M., Fusco, F., Lazos, P., Leonardi, S., Papadigenopoulos, O., Pountourakis, E., & Reiffenhäuser, R. (2022). Single-Sample Prophet Inequalities via Greedy-Ordered Selection. In J. Naor, & N. Buchbinder (Eds.), Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1298-1325). Society for Industrial and Applied Mathematics. https://doi.org/10.48550/arXiv.2111.03174, https://doi.org/10.1137/1.9781611977073.54 [details]

    2021

    • Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Marchetti-Spaccamela, A., & Reiffenhäuser, R. (2021). Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-Optimal Adaptive Complexity. Proceedings of Machine Learning Research, 139, 231-242. https://proceedings.mlr.press/v139/amanatidis21a.html
    • Dütting, P., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2021). Efficient two-sided markets with limited information. In S. Khuller, & V. V. Williams (Eds.), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (pp. 1452-1465). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/3406325.3451076

    2019

    • Reiffenhäuser, R. (2019). An optimal truthful mechanism for the online weighted bipartite matching problem. In T. M. Chan (Ed.), Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1982-1993). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.120

    2017

    • Azar, Y., Hoefer, M., Maor, I., Reiffenhäuser, R., & Vöcking, B. (2017). Truthful mechanism design via correlated tree rounding. Mathematical programming, 163(1-2), 445-469. https://doi.org/10.1007/s10107-016-1068-5

    2016

    • Nakhe, P., & Reiffenhauser, R. (2016). Trend detection based regret minimization for bandit problems. In Proceedings - 3rd IEEE International Conference on Data Science and Advanced Analytics, DSAA 2016 (pp. 263-271). Article 7796912 (Proceedings - 3rd IEEE International Conference on Data Science and Advanced Analytics, DSAA 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DSAA.2016.35

    2015

    • Azar, Y., Hoefer, M., Maor, I., Reiffenhaüser, R., & Vöcking, B. (2015). Truthful mechanism design via correlated tree rounding. In EC 2015 - Proceedings of the 2015 ACM Conference on Economics and Computation (pp. 415-432). (EC 2015 - Proceedings of the 2015 ACM Conference on Economics and Computation). Association for Computing Machinery, Inc. https://doi.org/10.1145/2764468.2764503

    2020

    • Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2020). Fast adaptive non-monotone submodular maximization subject to a knapsack constraint. Paper presented at 34th Conference on Neural Information Processing Systems, NeurIPS 2020, Virtual, Online.

    Prijs / subsidie

    • Reiffenhäuser, R. & Amanatidis, G. (2021). Best Paper Award - WINE 2021.

    Spreker

    • Reiffenhäuser, R. (speaker) (22-11-2024). Single-Sample Prophet Inequalities, Junior Workshop on Mathematical Game Theory, Rome.
    • Reiffenhäuser, R. (speaker) (29-10-2024). Online Combinatorial Allocations and Auctions with Few Samples, 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago.
    • Reiffenhäuser, R. (speaker) (3-9-2024). Prophet Inequalities with Limited Information, 17th International Symposium on Algorithmic Game Theory, SAGT 2024, Amsterdam.
    • Reiffenhäuser, R. (speaker) (28-6-2024). Combinatorial Single-Sample Prophet Inequalities, Workshop 'Online Resource Allocation' at STOC 2024 TheoryFest, Vancouver.
    • Mauras, S. (speaker), Mohan, D. (speaker) & Reiffenhäuser, R. (speaker) (26-6-2024). Tutorial: Approximation Mechanisms with Interdependent Values, EC preview week.
    • Reiffenhäuser, R. (speaker) (14-3-2024). Fairness in Non-Truthful Algorithms with Strategic Agents, Amsterdam - Saint Etienne Workshop on Social Choice, Saint Etienne.
    • Reiffenhäuser, R. (speaker) (9-11-2023). Combinatorial Online Selection with Minimal Priors, Dutch Day on Optimization, Maastricht.
    • Reiffenhäuser, R. (speaker) (29-6-2023). Online Max-Weight Matching with Limited Priors, Informs Applied Probability Society Conference 2023, Nancy.
    • Reiffenhäuser, R. (speaker) (6-6-2023). Single Sample Prophet Inequalities, Algorithms, Learning and Games, Punta Sampieri.
    • Reiffenhäuser, R. (speaker) (24-3-2023). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness, FOAM Seminar, Amsterdam.
    • Reiffenhäuser, R. (speaker) (5-3-2023). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria, Israel AGT Day, Tel Aviv.

    Andere

    • Reiffenhäuser, R. (participant) (27-10-2023). Alice & Eve 2023, Amsterdam. Part of the Organizing Committee and Program Committee (organising a conference, workshop, ...).
    • Reiffenhäuser, R. (participant) (10-10-2023 - 12-12-2023). The 23rd International Conference on Autonomous Agents and Multi-Agent Systems, Auckland. Served on the Program Committee. (organising a conference, workshop, ...).
    This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list.
  • Nevenwerkzaamheden
    Geen nevenwerkzaamheden
contactgegevens bewerken   bewerk profielinformatie