Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 16
Number of items: 16
  • Open Access
    Dütting, P., Fusco, F., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2026). Efficient Two-Sided Markets with Limited Information. SIAM Journal on Computing, 55(1), 65-92. https://doi.org/10.1137/22M1518918
  • Open Access
    Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Marchetti-Spaccamela, A., & Reiffenhäuser, R. (2026). Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity. Theoretical Computer Science, 1060, Article 115629. https://doi.org/10.1016/j.tcs.2025.115629
  • Open Access
    Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2025). Algorithmically Fair Maximization of Multiple Submodular Objective Functions. In Y. Vorobeychik, S. Das, & A. Nowe (Eds.), AAMAS '25: Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems : May 19-23, 2025, Detroit, Michigan, USA (pp. 115-123). International Foundation for Autonomous Agents and Multiagent Systems. https://dl.acm.org/doi/10.5555/3709347.3743523
  • Open Access
    Ezra, T., Leonardi, S., Reiffenhauser, R., Russo, M., & Tsigonias-Dimitriadis, A. (2025). Prophet Inequalities via the Expected Competitive Ratio. ACM Transactions on Economics and Computation , 13(2), Article 7. https://doi.org/10.1145/3717076
  • Open Access
    Feldman, M., Mauras, S., Mohan, D., & Reiffenhäuser, R. (2025). Online Combinatorial Allocation with Interdependent Values. In EC '25: Proceedings of the Twenty-Sixth ACM Conference on Economics and Computation : July 7-10, 2025, Stanford, CA, USA (pp. 189-205). Association for Computing Machinery. https://doi.org/10.1145/3736252.3742518
  • Open Access
    Amanatidis, G., Berger, B., Ezra, T., Feldman, M., Fusco, F., Reiffenhäuser, R., & Tsikiridis, A. (2025). Pandora's box problem with time constraints. Artificial Intelligence, 349, Article 104426. https://doi.org/10.1016/j.artint.2025.104426
  • Open Access
    Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., & Reiffenhäuser, R. (2025). Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. Mathematics of operations research, 50(4), 2717-2737. https://doi.org/10.1287/moor.2023.0244
  • Open Access
    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
  • Open Access
    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
  • Open Access
    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
Page 1 of 2