Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

J. Cermák, B. Bosanský, K. Horák, V. Lisý, and M. Pechoucek. Int. J. Approx. Reason., (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

Other publications of authors with the same name

Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games.J. Cermák, B. Bosanský, and M. Pechoucek. AAMAS, page 902-910. ACM, (2017)Algorithms for computing strategies in two-player simultaneous move games.B. Bosanský, V. Lisý, M. Lanctot, J. Cermák, and M. Winands. Artif. Intell., (2016)Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract).J. Cermák, V. Lisý, and B. Bosanský. IJCAI, page 5030-5034. ijcai.org, (2020)Journal track.Solving Imperfect Recall Games.J. Cermák. AAMAS, page 1820-1821. ACM, (2017)Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games.J. Cermák, B. Bosanský, and N. Gatti. AAMAS, page 1813-1814. ACM, (2015)Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games.J. Cermák, V. Lisý, and B. Bosanský. Artif. Intell., (2020)Approximating maxmin strategies in imperfect recall games using A-loss recall property.J. Cermák, B. Bosanský, K. Horák, V. Lisý, and M. Pechoucek. Int. J. Approx. Reason., (2018)Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games.J. Cermák, B. Bosanský, and V. Lisý. ECAI, volume 263 of Frontiers in Artificial Intelligence and Applications, page 201-206. IOS Press, (2014)Towards Solving Imperfect Recall Games.J. Cermak, and B. Bosanský. AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games.J. Cermak, B. Bosanský, and V. Lisý. IJCAI, page 936-942. ijcai.org, (2017)

BibSonomy

Disambiguation of "Cermák, Jirí"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Cermák, Jirí"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Approximating maxmin strategies in imperfect recall games using A-loss recall property.

Please choose a person to relate this publication to

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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