Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 17
Number of items: 17
  • 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., Fusco, F., Reiffenhäuser, R., & Tsikiridis, A. (2026). Pandora’s Box Problem Over Time. In M. Mavronicolas, Q. Qi, & G. Schoenebeck (Eds.), Web and Internet Economics: 20th International Conference, WINE 2024, Edinburgh, UK, December 2–5, 2024 : proceedings (pp. 494-512). (Lecture Notes in Computer Science; Vol. 15534). Springer. https://doi.org/10.1007/978-3-032-08560-3_28
  • 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
    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
    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
    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
    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
  • Open Access
    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
Page 1 of 2