( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract).

, , и . IJCAI, стр. 5030-5034. ijcai.org, (2020)Journal track.

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.

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

 

Другие публикации лиц с тем же именем

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract)., , и . IJCAI, стр. 5030-5034. ijcai.org, (2020)Journal track.Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games., , и . AAMAS, стр. 902-910. ACM, (2017)Algorithms for computing strategies in two-player simultaneous move games., , , , и . Artif. Intell., (2016)Solving Imperfect Recall Games.. AAMAS, стр. 1820-1821. ACM, (2017)Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games., , и . AAMAS, стр. 1813-1814. ACM, (2015)Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games., , и . ECAI, том 263 из Frontiers in Artificial Intelligence and Applications, стр. 201-206. IOS Press, (2014)Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games., , и . Artif. Intell., (2020)Towards Solving Imperfect Recall Games., и . AAAI Workshops, том WS-17 из AAAI Technical Report, AAAI Press, (2017)Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall., , , и . ICAART (2), стр. 63-74. SciTePress, (2017)Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games., , , , и . AAMAS, стр. 335-342. IFAAMAS, (2013)