| Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games J Cermak, B Bosansky, K Durkota, V Lisy, C Kiekintveld AAAI Conference on Artificial Intelligence (AAAI-16), 2016 | 56 | 2016 |
| Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games B Bošanský, J Čermák AAAI Conference on Artificial Intelligence 29, 805, 2015 | 53 | 2015 |
| Algorithms for computing strategies in two-player simultaneous move games B Bošanský, V Lisý, M Lanctot, J Čermák, MHM Winands Artificial Intelligence 237, 1-40, 2016 | 52 | 2016 |
| Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games B Bosansky, C Kiekintveld, V Lisy, J Cermak, M Pechoucek Proceedings of the 2013 international conference on Autonomous agents and …, 2013 | 27 | 2013 |
| An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games J Cermak, B Bosansky, L V. Twenty-Sixth International Joint Conference on Artificial Intelligence, 936-942, 2017 | 20 | 2017 |
| Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games J Čermák, B Bošanský, V Lisý 21st European Conference on Artificial Intelligence (ECAI 2014), 201 - 206, 2014 | 13 | 2014 |
| Approximating maxmin strategies in imperfect recall games using A-loss recall property J Čermák, B Bošanský, K Horák, V Lisý, M Pěchouček International Journal of Approximate Reasoning 93, 290-326, 2018 | 12 | 2018 |
| Using double-oracle method and serialized alpha-beta search for pruning in simultaneous move games B Bosansky, V Lisy, J Cermak, R Vitek, M Pechoucek Twenty-Third International Joint Conference on Artificial Intelligence, 2013 | 10 | 2013 |
| Combining incremental strategy generation and branch and bound search for computing maxmin strategies in imperfect recall games J Čermák, B Bošanský, M Pěchouček Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017 | 9 | 2017 |
| Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall B Bosansky, J Cermak, K Horak, M Pechoucek International Conference on Agents and Artificial Intelligence, 2017 | 6 | 2017 |
| Údolí motolského potoka J Čermák | 6 | 1914 |
| Towards solving imperfect recall games J Cermak, B Bosansky Workshops at the Thirty-First AAAI Conference on Artificial Intelligence, 2017 | 5 | 2017 |
| Poznámka o limitním přechodu diferenčních rovnic v rovnice diferenciální J Čermák Časopis pro pěstování matematiky 81 (2), 224-228, 1956 | 5 | 1956 |
| Learning with Proxy Supervision for End-To-End Visual Learning J Cermak, A Angelova Deep Learning for Vehicle Perception Workshop, Intelligent Vehicles Symposium, 2017 | 4 | 2017 |
| O systémech lineárních diferenčních rovnic s periodickými koeficienty J Čermák Časopis pro pěstování matematiky 79 (2), 141-150, 1954 | 4 | 1954 |
| Constructing imperfect recall abstractions to solve large extensive-form games J Cermak, V Lisy, B Bosansky arXiv preprint arXiv:1803.05392, 2018 | 3 | 2018 |
| Lerchův přínos k obecné theorii funkcí J Čermák Dílo Matyáše Lercha v oboru matematické analýzy, 419-433, 1957 | 2 | 1957 |
| Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games J Čermák, V Lisý, B Bošanský Artificial Intelligence 282, 103248, 2020 | 1 | 2020 |
| Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games J Čermák, B Bošanský, N Gatti Proceedings of the 2015 international conference on Autonomous agents and …, 2015 | 1 | 2015 |
| Analýza sady algoritmů pro řešení extenzivních her s nekompletní informací J Čermák České vysoké učení technické v Praze. Vypočetní a informační centrum., 2012 | 1 | 2012 |
Branislav BošanskýAssociate Professor, Dept. of Computer Science, FEE, Czech Technical University in PragueE-mailová adresa ověřena na: agents.fel.cvut.cz
