Politechnika Warszawska, Wydział Matematyki i Nauk Informacyjnych, Zakład Sztucznej Inteligencji i Metod Obliczeniowych
(Warsaw University of Technology, Faculty of Mathematics and Information Science, Division of AI and Computational Methods) Jan.Karwowski@mini.pw.edu.pl
Research interests
approximate and sampling-based methods in game theory, in particular efficient approximation of Stackelberg Equilibrium in extensive-form games,
Monte Carlo Tree Search and its applications to optimization problems,
AI in board games.
Publication list
Karwowski J., Mańdziuk J. (2019) A Monte Carlo Tree Search approach to finding efficient patrolling schemes on graphs. European Journal of Operational Research. Volume 277, Issue 1, Pages 255-268. DOI:10.1016/j.ejor.2019.02.017
Karwowski J., Mańdziuk J. (2017) The Impact of the Number of Averaged Attacker’s Strategies on the Results Quality in Mixed-UCT. Artificial Intelligence and Soft Computing. ICAISC 2017. Lecture Notes in Computer Science, vol 10246. Springer, Cham POSTER
Karwowski J., Mańdziuk J. (2016) Mixed Strategy Extraction from UCT Tree in Security Games, Frontiers in Artificial Intelligence and Applications, Volume 285: ECAI 2016, pp. 1746-1747 (ECAI’16 short paper) POSTER
Karwowski J., Mańdziuk J. (2015) A New Approach to Security Games. Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science, vol 9120. Springer, Cham POSTER
Karwowski J., Okulewicz M., Legierski J. (2013) Application of Particle Swarm Optimization Algorithm to Neural Network Training Process in the Localization of the Mobile Terminal. Engineering Applications of Neural Networks. EANN 2013. Communications in Computer and Information Science, vol 383. Springer, Berlin, Heidelberg
Luckner M., Karwowski J. (2017) Estimation of Delays for Individual Trams to Monitor Issues in Public Transport Infrastructure. Computational Collective Intelligence. ICCCI 2017. Lecture Notes in Computer Science, vol 10448. Springer, Cham