Prof. dr. G. (Guido) Schaefer
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
ILLC
Bezoekadres
- Science Park 107
Postadres
-
Postbus 94242
1090 GE Amsterdam
Contactgegevens
-
Publicaties
2024
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]
2023
- 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]
2022
- 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 [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]
2021
- 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]
2014
- Apt, K. R., & Schäfer, G. (2014). Selfishness Level of Strategic Games. Journal of Artificial Intelligence Research, 49, 207-240. https://doi.org/10.1613/jair.4164 [details]
- Apt, K. R., Rahn, M., Schäfer, G., & Simon, S. (2014). Coordination Games on Graphs. In T.-Y. Liu, Q. Qi, & Y. Ye (Eds.), Web and Internet Economics: 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014: proceedings (pp. 441-446). (Lecture Notes in Computer Science; Vol. 8877). Springer. https://doi.org/10.1007/978-3-319-13129-0_37 [details]
2012
- Apt, K. R., & Schäfer, G. (2012). Selfishness level of strategic games. In M. Serna (Ed.), Algorithmic Game Theory: 5th international symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012: proceedings (pp. 13-24). (Lecture Notes in Computer Science; Vol. 7615). Springer. https://doi.org/10.1007/978-3-642-33996-7_2 [details]
2024
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list. -
Nevenwerkzaamheden
-
Centrum Wiskunde & Informatica
senior researcher
group leader
-
Centrum Wiskunde & Informatica
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.