Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 14
Number of items: 14
  • 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
  • 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
    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., 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
  • Open Access
    Amanatidis, G., Klumper, S., Markakis, E., Schäfer, G., & Tsikiridis, A. (2024). Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. 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. 41-58). (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_3
  • 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
  • Open Access
    Amanatidis, G., Kleer, P., & Schäfer, G. (2022). Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online. Mathematics of operations research, 47(3), 2286-2309. https://doi.org/10.1287/moor.2021.1208
  • Open Access
    Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2021). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. In AAAI-21, IAAI-21, EAAI-21 proceedings: a virtual conference, February 2-9, 2021 : Thirty-Fifth AAAI Conference on Artificial Intelligence, Thirty-Third Conference on Innovative Applications of Articicial Intelligence, Eleventh Symposium on Educational Advances in Artificial Intelligence (Vol. 6, pp. 5078-5085). (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 35). AAAI Press. https://doi.org/10.48550/arXiv.2009.06543, https://doi.org/10.1609/aaai.v35i6.16642
  • Amanatidis, G., Markakis, E., & Ntokos, A. (2020). Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. Theoretical Computer Science, 841, 94-109. https://doi.org/10.1016/j.tcs.2020.07.006
Page 1 of 2