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[details]
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[details]
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[details]
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[details]
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[details]
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[details]
van Beek, A., Brokkelkamp, R., & Schäfer, G. (2022). Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions. In AAMAS '22: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (Vol. 2, pp. 1283-1291). International Foundation for Autonomous Agents and Multiagent Systems. https://dl.acm.org/doi/10.5555/3535850.3535993[details]
Huizing, D., & Schäfer, G. (2021). The Traveling k-Median Problem: Approximating Optimal Network Coverage. In J. Koenemann, & B. Peis (Eds.), Approximation and Online Algorithms: 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021 : revised selected papers (pp. 80-98). (Lecture Notes in Computer Science; Vol. 12982). Springer. https://doi.org/10.1007/978-3-030-92702-8_6[details]
Kleer, P., & Schäfer, G. (2021). Computation and efficiency of potential function minimizers of combinatorial congestion games. Mathematical programming, 190(1-2), 523-560. https://doi.org/10.1007/s10107-020-01546-6[details]
Feijen, W. (2024). Fast, right, or best? Algorithms for practical optimization problems. [Thesis, fully internal, Universiteit van Amsterdam]. [details]
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.