Jiri Cermak

According to our database, Jiri Cermak authored at least 17 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games.

Jirí Cermák, Viliam Lisý, Branislav Bosanský

Artif. Intell., 2020

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract).

Jirí Cermák, Viliam Lisý, Branislav Bosanský

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018

Approximating maxmin strategies in imperfect recall games using A-loss recall property.

Jirí Cermák, Branislav Bosanský, Karel Horák, Viliam Lisý, Michal Pechoucek

Int. J. Approx. Reason., 2018

Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games.

Jiri Cermak, Viliam Lisý, Branislav Bosanský

CoRR, 2018

2017

Learning with proxy supervision for end-to-end visual learning.

Jiri Cermak, Anelia Angelova

Proceedings of the IEEE Intelligent Vehicles Symposium, 2017

An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games.

Jiri Cermak, Branislav Bosanský, Viliam Lisý

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall.

Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Solving Imperfect Recall Games.

Jirí Cermák

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games.

Jiri Cermak, Branislav Bosanský, Michal Pechoucek

Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Towards Solving Imperfect Recall Games.

Jiri Cermak, Branislav Bosanský

Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Algorithms for computing strategies in two-player simultaneous move games.

Branislav Bosanský, Viliam Lisý, Marc Lanctot, Jirí Cermák, Mark H. M. Winands

Artif. Intell., 2016

Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games.

Jiri Cermak, Branislav Bosanský, Karel Durkota, Viliam Lisý, Christopher Kiekintveld

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games.

Jirí Cermák, Branislav Bosanský, Nicola Gatti

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games.

Branislav Bosanský, Jiri Cermak

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games.

Jirí Cermák, Branislav Bosanský, Viliam Lisý

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013

Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games.

Branislav Bosanský, Viliam Lisý, Jiri Cermak, Roman Vitek, Michal Pechoucek

Proceedings of the IJCAI 2013, 2013

Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games.

Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Jiri Cermak, Michal Pechoucek

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013