Filip Úradník

I am a master’s student in computer science at the Faculty of Mathematics and Physics, Charles University. Though I usually prefer purely theoretical projects, I also enjoy projects that blend theory and application. I am passionate about free and open source software and all things Neovim.

For more information, see my CV, either in Czech or English.

Contact me

Research

I am interested in a wide array of topics, including reinforcement learning, game theory, combinatorics, and graph theory.

See a list of my publications below. For more information, visit my Google Scholar profile. An underline indicates equal contribution.

Úradník, F., Wang, A., Gao, J., 2025. Maximizing Truth Learning in a Social Network is NP-hard. In: Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’25. International Foundation for Autonomous Agents; Multiagent Systems, Richland, SC, pp. 2078–2086.
Úradník, F., Sychrovský, D., Černý, J., Černý, M., 2024. Reducing Optimism Bias in Incomplete Cooperative Games. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’24. International Foundation for Autonomous Agents; Multiagent Systems, Richland, SC, pp. 1847–1855.
Úradník, F., 2024. Balancing Space Complexity and Ambiguity in Superadditive Set Functions (Bachelor's thesis). Charles University, Faculty of Mathematics and Physics, Department of Applied Mathematics, Prague.