Amanatidis, G., & Reiffenhäuser, R. E. M. (2023). Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. Mathematics of operations research. Advance online publication. https://doi.org/10.1287/moor.2022.0058
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]
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]
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) (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, ...).
De UvA gebruikt cookies voor het meten, optimaliseren en goed laten functioneren van de website. Ook worden er cookies geplaatst om inhoud van derden te kunnen tonen en voor marketingdoeleinden. Klik op ‘Accepteren’ om akkoord te gaan met het plaatsen van alle cookies. Of kies voor ‘Weigeren’ om alleen functionele en analytische cookies te accepteren. Je kunt je voorkeur op ieder moment wijzigen door op de link ‘Cookie instellingen’ te klikken die je onderaan iedere pagina vindt. Lees ook het UvA Privacy statement.