default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiri Cermak
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j3]Jirí Cermák, Viliam Lisý, Branislav Bosanský:
Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. Artif. Intell. 282: 103248 (2020)- [c14]Jirí Cermák, Viliam Lisý, Branislav Bosanský:
Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract). IJCAI 2020: 5030-5034
2010 – 2019
- 2018
- [j2]Jirí Cermák, Branislav Bosanský, Karel Horák, Viliam Lisý
, Michal Pechoucek:
Approximating maxmin strategies in imperfect recall games using A-loss recall property. Int. J. Approx. Reason. 93: 290-326 (2018) - [i2]Jiri Cermak, Viliam Lisý, Branislav Bosanský:
Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. CoRR abs/1803.05392 (2018) - 2017
- [c13]Jiri Cermak, Branislav Bosanský:
Towards Solving Imperfect Recall Games. AAAI Workshops 2017 - [c12]Jiri Cermak, Branislav Bosanský, Michal Pechoucek:
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAAI Workshops 2017 - [c11]Jirí Cermák, Branislav Bosanský, Michal Pechoucek:
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAMAS 2017: 902-910 - [c10]Jirí Cermák:
Solving Imperfect Recall Games. AAMAS 2017: 1820-1821 - [c9]Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek:
Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. ICAART (2) 2017: 63-74 - [c8]Jiri Cermak, Branislav Bosanský, Viliam Lisý:
An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. IJCAI 2017: 936-942 - [c7]Jiri Cermak, Anelia Angelova:
Learning with proxy supervision for end-to-end visual learning. Intelligent Vehicles Symposium 2017: 1-6 - 2016
- [j1]Branislav Bosanský, Viliam Lisý, Marc Lanctot, Jirí Cermák, Mark H. M. Winands:
Algorithms for computing strategies in two-player simultaneous move games. Artif. Intell. 237: 1-40 (2016) - [c6]Jiri Cermak, Branislav Bosanský, Karel Durkota, Viliam Lisý, Christopher Kiekintveld:
Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. AAAI 2016: 439-445 - [i1]Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek:
Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall. CoRR abs/1608.01510 (2016) - 2015
- [c5]Branislav Bosanský, Jiri Cermak:
Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games. AAAI 2015: 805-811 - [c4]Jirí Cermák, Branislav Bosanský, Nicola Gatti:
Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. AAMAS 2015: 1813-1814 - 2014
- [c3]Jirí Cermák, Branislav Bosanský, Viliam Lisý:
Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. ECAI 2014: 201-206 - 2013
- [c2]Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Jiri Cermak, Michal Pechoucek:
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. AAMAS 2013: 335-342 - [c1]Branislav Bosanský, Viliam Lisý, Jiri Cermak, Roman Vitek, Michal Pechoucek:
Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games. IJCAI 2013: 48-54
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
