Ruben Brokkelkamp

Full Name: K.R. Brokkelkamp
Function(s): PhD student - Unknown

Email: Ruben.Brokkelkamp@cwi.nl
Telephone: +31 20 592 4160
Room: M236
Department(s): Networks and Optimization
Homepage: https://ruben.brokkelkamp.com

Biography

Ruben Brokkelkamp completed a master's degree in Mathematics after obtaining bachelor degrees in Mathematics and Computer Science. After having worked for ORTEC for 2 years, he joined CWI's Networks and Optimization group in 2018 as a PhD student under the supervision of Guido Schäfer in the area of algorithmic game theory. His research is funded by the NWO gravitation programme NETWORKS.

Publications

Brokkelkamp, K.R. (2022, September 21). How close does it get? From near-optimal network algorithms to suboptimal equilibrium outcomes. ILLC Dissertation Series.
van Beek, A, Brokkelkamp, K.R, & Schäfer, G. (2022). Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (pp. 1283–1291).
Kuiper, A, Mandjes, M.R.H, de Mast, J, & Brokkelkamp, K.R. (2021). A flexible and optimal approach for appointment scheduling in healthcare. Decision Sciences. doi:10.1111/deci.12517
Saha, A, Brokkelkamp, K.R, Velaj, Y, Khan, A, & Bonchi, F. (2021). Shortest paths and centrality in uncertain networks. In Proceedings of the VLDB Endowment (pp. 1188–1201). doi:10.14778/3450980.3450988
Brokkelkamp, K.R, van Venetië, R., de Vries, M.J, & Westerdiep, J. (2020). PACE Solver Description: tdULL. In 15th International Symposium on Parameterized and Exact Computation. doi:10.4230/LIPIcs.IPEC.2020.29
Brokkelkamp, K.R, Polak, S.C, Schäfer, G, & Velaj, Y. (2019). Approximate pricing in networks: How to boost the betweenness and revenue of a node. In 30th International Symposium on Algorithms and Computation (pp. 13:1–13:15). doi:10.4230/LIPIcs.ISAAC.2019.13

Current projects with external funding

Networks