Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 18
Number of items: 18
  • Open Access
    Brokkelkamp, R. (2022). How close does it get? From near-optimal network algorithms to suboptimal equilibrium outcomes. [Thesis, externally prepared, Universiteit van Amsterdam].
  • 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
    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
  • 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
  • Open Access
    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
  • 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
  • Open Access
    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
  • 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
Page 2 of 2