Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 18
Number of items: 18
  • Open Access
    Kashaev, D. (2026). Approximation via duality in offline, online and strategic settings. [Thesis, externally prepared, Universiteit van Amsterdam].
  • Open Access
    van Heuven van Staereling, I., de Keijzer, B., & Schäfer, G. (2025). The Ground-Set-Cost Budgeted Maximum Coverage Problem. Theory of Computing Systems, 69(4), Article 39. https://doi.org/10.1007/s00224-025-10248-5
  • Open Access
    Klumper, S. J. (2025). The gap and the gain: Improving approximate mechanism design frontier in constrained environments. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Feijen, W. (2024). Fast, right, or best? Algorithms for practical optimization problems. [Thesis, fully internal, Universiteit van Amsterdam].
  • 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
  • Open Access
    Kashaev, D., & Schäfer, G. (2023). Round and Bipartize for Vertex Cover Approximation. In N. Megow, & A. Smith (Eds.), International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) Article 20 (Leibniz International Proceedings in Informatics; Vol. 275). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.20, https://doi.org/10.48550/arXiv.2211.01699
  • Birmpas, G., Markakis, E., & Schäfer, G. (2022). Cost Sharing over Combinatorial Domains. ACM Transactions on Economics and Computation , 10(1), Article 4. https://doi.org/10.1145/3505586
  • Klumper, S., & Schäfer, G. (2022). Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. In P. Kanellopoulos, M. Kyropoulou, & A. Voudouris (Eds.), Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022 : proceedings (pp. 78-93). (Lecture Notes in Computer Science; Vol. 13584), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-031-15714-1_5
  • Brokkelkamp, R., Hoeijmakers, S., & Schäfer, G. (2022). Greater Flexibility in Mechanism Design Through Altruism. In P. Kanellopoulos, M. Kyropoulou, & A. Voudouris (Eds.), Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022 : proceedings (pp. 41-59). (Lecture Notes in Computer Science; Vol. 13584), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-031-15714-1_3
  • Huizing, D., van der Mei, R., Schäfer, G., & Bhulai, S. (2022). The enriched median routing problem and its usefulness in practice. Computers & Industrial Engineering, 168, Article 108063. https://doi.org/10.1016/j.cie.2022.108063
Page 1 of 2